Transformation-based image coding method and device therefor

ABSTRACT

An image decoding method according to the present document comprises the steps of: determining whether or not an effective coefficient is present in a second area not including an upper-left first area of a current block; parsing an MTS index from a bitstream on the basis that the effective coefficient is not present in the second area; and deriving residual samples for the current block by applying a transform kernel, which is derived on the basis of the MTS index, to transform coefficients in the first area, wherein the MTS index can be parsed on the basis that the effective coefficient, which is present in a scan sub-block which is scanned for the effective coefficient, is not present in the second area.

TECHNICAL FIELD

The present disclosure relates to an image coding technique and, more particularly, to a method and an apparatus for coding an image based on transform in an image coding system.

RELATED ART

Nowadays, the demand for high-resolution and high-quality images/videos such as 4K, 8K or more ultra high definition (UHD) images/videos has been increasing in various fields. As the image/video data becomes higher resolution and higher quality, the transmitted information amount or bit amount increases as compared to the conventional image data. Therefore, when image data is transmitted using a medium such as a conventional wired/wireless broadband line or image/video data is stored using an existing storage medium, the transmission cost and the storage cost thereof are increased.

Further, nowadays, the interest and demand for immersive media such as virtual reality (VR), artificial reality (AR) content or hologram, or the like is increasing, and broadcasting for images/videos having image features different from those of real images, such as a game image is increasing.

Accordingly, there is a need for a highly efficient image/video compression technique for effectively compressing and transmitting or storing, and reproducing information of high resolution and high quality images/videos having various features as described above.

SUMMARY

A technical aspect of the present disclosure is to provide a method and an apparatus for increasing image coding efficiency.

Another technical aspect of the present disclosure is to provide a method and an apparatus for increasing efficiency in coding a transform index.

Still another technical aspect of the present disclosure is to provide an image coding method and an image coding apparatus using an MTS.

Yet another technical aspect of the present disclosure is to provide an image coding method and an image coding apparatus for signaling of an MTS index.

According to an embodiment of the present disclosure, there is provided an image decoding method performed by a decoding apparatus. The method may include: determining whether a significant coefficient exists in a second region other than a top-left first region of the current block; parsing an MTS index from the bitstream based on the significant coefficient not being present in the second region; and deriving residual samples for the current block by applying a transform kernel derived based on the MTS index to transform coefficients in the first region, wherein the significant coefficient exists in a scan subblock in which the significant coefficient is scanned, wherein the MTS index is parsed based on the significant coefficient not being present in the second region.

The determining whether the significant coefficient exists in the second region comprises determining whether a value of a flag indicating whether the significant coefficient exists in the scan subblock is 1; and determining whether the significant coefficient existing in the scan subblock is positioned in the second region.

The determining whether the significant coefficient exists in the second region comprises determining whether a value of a flag indicating whether the significant coefficient exists in the scan subblock is 1; and determining whether the scan subblock is positioned in the second region.

The determining whether the significant coefficient exists in the second region comprises deriving flag information indicating whether the significant coefficient exists in the second region, wherein the flag information is initially set to 1, and wherein, when the significant coefficient is positioned in the second region, the flag information is changed to 0.

The first region is a top-left 16×16 region of the current block, and wherein the scan subblock is a 4×4 block.

The scan subblock is scanned according to a reverse diagonal scan direction from the position of the last significant coefficient in the current block.

According to an embodiment of the present disclosure, there is provided an image encoding method performed by an encoding apparatus. The method may include: deriving transform coefficients for the current block based on a primary transform for the residual samples; zeroing out a second region other than a top-left first region of the current block; constructing image information to parse the MTS index based on the significant coefficient not being present in the second region, wherein the significant coefficient exists in a scan subblock in which the significant coefficient is scanned; and encoding residual information derived based on the transform coefficients for the current block and an MTS index.

According to still another embodiment of the present disclosure, there may be provided a digital storage medium that stores image data including encoded image information and a bitstream generated according to an image encoding method performed by an encoding apparatus.

According to yet another embodiment of the present disclosure, there may be provided a digital storage medium that stores image data including encoded image information and a bitstream to cause a decoding apparatus to perform the image decoding method.

According to the present disclosure, it is possible to increase overall image/video compression efficiency.

According to the present disclosure, it is possible to increase efficiency in coding an MTS index.

According to the present disclosure, it is possible to increase efficiency of an image coding method using an MTS.

The effects that can be obtained through specific examples of the present disclosure are not limited to the effects listed above. For example, there may be various technical effects that a person having ordinary skill in the related art can understand or derive from the present disclosure. Accordingly, specific effects of the present disclosure are not limited to those explicitly described in the present disclosure and may include various effects that can be understood or derived from the technical features of the present disclosure.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a diagram schematically describing a configuration of a video/image encoding apparatus to which the present document may be applied.

FIG. 2 is a diagram schematically describing a configuration of a video/image decoding apparatus to which the present document may be applied.

FIG. 3 schematically illustrates a multiple transform technique according to an embodiment of the present disclosure.

FIG. 4 exemplarily shows intra directional modes of 65 prediction directions.

FIG. 5 is a diagram illustrating an RST according to an embodiment of the present disclosure.

FIG. 6 is a diagram illustrating a sequence of arranging output data of a forward primary transformation into a one-dimensional vector according to an example.

FIG. 7 is a diagram illustrating a sequence of arranging output data of a forward secondary transform into a two-dimensional block according to an example.

FIG. 8 is a diagram illustrating a block shape to which the LFNST is applied.

FIG. 9 is a diagram illustrating an arrangement of output data of a forward LFNST according to an example.

FIG. 10 illustrates zeroing-out in a block to which a 4×4 LFNST is applied according to an example.

FIG. 11 illustrates zeroing-out in a block to which an 8×8 LFNST is applied according to an example.

FIG. 12 illustrates a scan of a 32×32 transform block according to an embodiment of the present disclosure.

FIG. 13 illustrates an image decoding method according to an example.

FIG. 14 illustrates an image encoding method according to an example.

FIG. 15 schematically illustrates an example of a video/image coding system to which the present disclosure is applicable.

FIG. 16 illustrates the structure of a content streaming system to which the present disclosure is applied.

DESCRIPTION OF EXEMPLARY EMBODIMENTS

While the present disclosure may be susceptible to various modifications and include various embodiments, specific embodiments thereof have been shown in the drawings by way of example and will now be described in detail. However, this is not intended to limit the present disclosure to the specific embodiments disclosed herein. The terminology used herein is for the purpose of describing specific embodiments only, and is not intended to limit technical idea of the present disclosure. The singular forms may include the plural forms unless the context clearly indicates otherwise. The terms such as “include” and “have” are intended to indicate that features, numbers, steps, operations, elements, components, or combinations thereof used in the following description exist, and thus should not be understood as that the possibility of existence or addition of one or more different features, numbers, steps, operations, elements, components, or combinations thereof is excluded in advance.

Meanwhile, each component on the drawings described herein is illustrated independently for convenience of description as to characteristic functions different from each other, and however, it is not meant that each component is realized by a separate hardware or software. For example, any two or more of these components may be combined to form a single component, and any single component may be divided into plural components. The embodiments in which components are combined and/or divided will belong to the scope of the patent right of the present disclosure as long as they do not depart from the essence of the present disclosure.

Hereinafter, preferred embodiments of the present disclosure will be explained in more detail while referring to the attached drawings. In addition, the same reference signs are used for the same components on the drawings, and repeated descriptions for the same components will be omitted.

This document relates to video/image coding. For example, the method/example disclosed in this document may relate to a VVC (Versatile Video Coding) standard (ITU-T Rec. H.266), a next-generation video/image coding standard after VVC, or other video coding related standards (e.g., HEVC (High Efficiency Video Coding) standard (ITU-T Rec. H.265), EVC (essential video coding) standard, AVS2 standard, etc.).

In this document, a variety of embodiments relating to video/image coding may be provided, and, unless specified to the contrary, the embodiments may be combined to each other and be performed.

In this document, a video may mean a set of a series of images over time. Generally a picture means a unit representing an image at a specific time zone, and a slice/tile is a unit constituting a part of the picture. The slice/tile may include one or more coding tree units (CTUs). One picture may be constituted by one or more slices/tiles. One picture may be constituted by one or more tile groups. One tile group may include one or more tiles.

A pixel or a pel may mean a smallest unit constituting one picture (or image). Also, ‘sample’ may be used as a term corresponding to a pixel. A sample may generally represent a pixel or a value of a pixel, and may represent only a pixel/pixel value of a luma component or only a pixel/pixel value of a chroma component. Alternatively, the sample may refer to a pixel value in the spatial domain, or when this pixel value is converted to the frequency domain, it may refer to a transform coefficient in the frequency domain.

A unit may represent the basic unit of image processing. The unit may include at least one of a specific region and information related to the region. One unit may include one luma block and two chroma (e.g., cb, cr) blocks. The unit and a term such as a block, an area, or the like may be used in place of each other according to circumstances. In a general case, an M×N block may include a set (or an array) of samples (or sample arrays) or transform coefficients consisting of M columns and N rows.

In this document, the term “/” and “,” should be interpreted to indicate “and/or.” For instance, the expression “A/B” may mean “A and/or B.” Further, “A, B” may mean “A and/or B.” Further, “AB/C” may mean “at least one of A, B, and/or C.” Also, “AB/C” may mean “at least one of A, B, and/or C.”

Further, in the document, the term “or” should be interpreted to indicate “and/or.” For instance, the expression “A or B” may include 1) only A, 2) only B, and/or 3) both A and B. In other words, the term “or” in this document should be interpreted to indicate “additionally or alternatively.”

In the present disclosure, “at least one of A and B” may mean “only A”, “only B”, or “both A and B”. In addition, in the present disclosure, the expression “at least one of A or B” or “at least one of A and/or B” may be interpreted as “at least one of A and B”.

In addition, in the present disclosure, “at least one of A, B, and C” may mean “only A”, “only B”, “only C”, or “any combination of A, B, and C”. In addition, “at least one of A, B, or C” or “at least one of A, B, and/or C” may mean “at least one of A, B, and C”.

In addition, a parenthesis used in the present disclosure may mean “for example”. Specifically, when indicated as “prediction (intra prediction)”, it may mean that “intra prediction” is proposed as an example of “prediction”. In other words, the “prediction” of the present disclosure is not limited to “intra prediction”, and “intra prediction” may be proposed as an example of “prediction”. In addition, when indicated as “prediction (i.e., intra prediction)”, it may also mean that “intra prediction” is proposed as an example of “prediction”.

Technical features individually described in one figure in the present disclosure may be individually implemented or may be simultaneously implemented.

FIG. 1 is a diagram schematically illustrating a configuration of a video/image encoding apparatus applicable to embodiments of this document. Hereinafter, what is referred to as the video encoding apparatus may include the image encoding apparatus.

Referring to FIG. 1 , the encoding apparatus 100 may include and be configured with an image partitioner 110, a predictor 120, a residual processor 130, an entropy encoder 140, an adder 150, a filter 160, and a memory 170. The predictor 120 may include an inter predictor 121 and an intra predictor 122. The residual processor 130 may include a transformer 132, a quantizer 133, a dequantizer 134, and an inverse transformer 135. The residual processor 130 may further include a subtractor 131. The adder 150 may be referred to as a reconstructor or reconstructed block generator. The image partitioner 110, the predictor 120, the residual processor 130, the entropy encoder 140, the adder 150, and the filter 160, which have been described above, may be configured by one or more hardware components (e.g., encoder chipsets or processors) according to an embodiment. Further, the memory 170 may include a decoded picture buffer (DPB), and may be constituted by a digital storage medium. The hardware component may further include the memory 170 as an internal/external component.

The image partitioner 110 may partition an input image (or a picture or a frame) input to the encoding apparatus 100 into one or more processing units. As one example, the processing unit may be called a coding unit (CU). In this case, starting with a coding tree unit (CTU) or the largest coding unit (LCU), the coding unit may be recursively partitioned according to the Quad-tree binary-tree ternary-tree (QTBTIT) structure. For example, one coding unit may be divided into a plurality of coding units of a deeper depth based on the quad-tree structure, the binary-tree structure, and/or the ternary structure. In this case, for example, the quad-tree structure may be applied first and the binary-tree structure and/or the ternary structure may be applied later. Alternatively, the binary-tree structure may be applied first. The coding procedure according to the present disclosure may be performed based on the final coding unit which is not further partitioned. In this case, the maximum coding unit may be used directly as a final coding unit based on coding efficiency according to the image characteristic. Alternatively, the coding unit may be recursively partitioned into coding units of a further deeper depth as needed, so that the coding unit of an optimal size may be used as a final coding unit. Here, the coding procedure may include procedures such as prediction, transform, and reconstruction, which will be described later. As another example, the processing unit may further include a prediction unit (PU) or a transform unit (TU). In this case, the prediction unit and the transform unit may be split or partitioned from the above-described final coding unit. The prediction unit may be a unit of sample prediction, and the transform unit may be a unit for deriving a transform coefficient and/or a unit for deriving a residual signal from a transform coefficient.

The unit and a term such as a block, an area, or the like may be used in place of each other according to circumstances. In a general case, an M×N block may represent a set of samples or transform coefficients consisting of M columns and N rows. The sample may generally represent a pixel or a value of a pixel, and may represent only a pixel/pixel value of a luma component, or only a pixel/pixel value of a chroma component. The sample may be used as a term corresponding to a pixel or a pel of one picture (or image).

In the encoding apparatus 100, a prediction signal (predicted block, prediction sample array) output from the inter predictor 121 or the intra predictor 122 may be subtracted from an input image signal (original block, original sample array) to generate a residual signal (residual block, residual sample array), and the generated residual signal is transmitted to the transformer 132. In this case, as shown, a unit of subtracting a prediction signal (predicted block, prediction sample array) from the input image signal (original block, original sample array) in the encoding apparatus 100 may be called the subtractor 131. The predictor may perform prediction on a processing target block (hereinafter, referred to as ‘current block’), and may generate a predicted block including prediction samples for the current block. The predictor may determine whether intra prediction or inter prediction is applied on a current block or CU basis. As discussed later in the description of each prediction mode, the predictor may generate various prediction related information, such as prediction mode information, and transmit the generated information to the entropy encoder 140. The prediction related information may be encoded in the entropy encoder 140, and be output in the form of a bitstream.

The intra predictor 122 may predict the current block by referring to samples in the current picture. The referred samples may be located in the neighbor of or apart from the current block according to the prediction mode. In the intra prediction, prediction modes may include a plurality of non-directional modes and a plurality of directional modes. The non-directional modes may include, for example, a DC mode and a planar mode. The directional mode may include, for example, 33 directional prediction modes or 65 directional prediction modes according to the degree of detail of the prediction direction. However, this is merely an example, and more or less directional prediction modes may be used depending on a setting. The intra predictor 122 may determine the prediction mode applied to the current block by using the prediction mode applied to the neighboring block.

The inter predictor 121 may derive a predicted block for the current block based on a reference block (reference sample array) specified by a motion vector on a reference picture. At this time, in order to reduce the amount of motion information transmitted in the inter prediction mode, the motion information may be predicted on a block, subblock, or sample basis based on correlation of motion information between the neighboring block and the current block. The motion information may include a motion vector and a reference picture index. The motion information may further include inter prediction direction (L0 prediction, L1 prediction, Bi prediction, etc.) information. In the case of inter prediction, the neighboring block may include a spatial neighboring block existing in the current picture and a temporal neighboring block existing in the reference picture. The reference picture including the reference block and the reference picture including the temporal neighboring block may be same to each other or different from each other. The temporal neighboring block may be called a collocated reference block, a collocated CU (colCU), and the like, and the reference picture including the temporal neighboring block may be called a collocated picture (colPic). For example, the inter predictor 121 may configure a motion information candidate list based on neighboring blocks and generate information indicating which candidate is used to derive a motion vector and/or a reference picture index of the current block. Inter prediction may be performed based on various prediction modes. For example, in the case of a skip mode and a merge mode, the inter predictor 121 may use motion information of the neighboring block as motion information of the current block. In the skip mode, unlike the merge mode, the residual signal may not be transmitted. In the case of the motion information prediction (motion vector prediction, MVP) mode, the motion vector of the neighboring block may be used as a motion vector predictor and the motion vector of the current block may be indicated by signaling a motion vector difference.

The predictor 120 may generate a prediction signal based on various prediction methods to be described below. For example, for prediction on one block, the predictor may apply either intra prediction or inter prediction, and, as well, apply both of intra prediction and inter prediction at the same time. The latter may be called combined inter and intra prediction (CIIP). Further, the predictor may be based on an intra block copy (IBC) prediction mode, or a palette mode in order to perform prediction on a block. The IBC prediction mode or palette mode may be used for content image/video coding of a game or the like, such as screen content coding (SCC). The IBC basically performs prediction in a current picture, but it may be performed similarly to inter prediction in that it derives a reference block in a current picture. That is, the IBC may use at least one of inter prediction techniques described in the present document. The palette mode may be regarded as an example of intra coding or intra prediction. When the palette mode is applied, a sample value in a picture may be signaled based on information on a palette index and a palette table.

The prediction signal generated through the predictor (including inter predictor 121 and/or the intra predictor 122) may be used to generate a reconstructed signal or to generate a residual signal. The transformer 132 may generate transform coefficients by applying a transform technique to the residual signal. For example, the transform technique may include at least one of a discrete cosine transform (DCT), a discrete sine transform (DST), a Karhunen-Loève transform (KLT), a graph-based transform (GBT), or a conditionally non-linear transform (CNT). Here, the GBT means transform obtained from a graph when relationship information between pixels is represented by the graph. The CNT means transform obtained based on a prediction signal generated using all previously reconstructed pixels. In addition, the transform process may be applied to square pixel blocks of the same size, or may be applied to non-square blocks of varying sizes.

The quantizer 133 may quantize the transform coefficients and transmit them to the entropy encoder 140, and the entropy encoder 140 may encode the quantized signal (information on the quantized transform coefficients) and output the encoded signal in a bitstream. The information on the quantized transform coefficients may be referred to as residual information. The quantizer 133 may rearrange block type quantized transform coefficients into a one-dimensional vector form based on a coefficient scan order, and generate information on the quantized transform coefficients based on the quantized transform coefficients of the one-dimensional vector form. The entropy encoder 140 may perform various encoding methods such as, for example, exponential Golomb, context-adaptive variable length coding (CAVLC), context-adaptive binary arithmetic coding (CABAC), and the like. The entropy encoder 140 may encode information necessary for video/image reconstruction other than quantized transform coefficients (e.g. values of syntax elements, etc.) together or separately. Encoded information (e.g., encoded video/image information) may be transmitted or stored on a unit basis of a network abstraction layer (NAL) in the form of a bitstream. The video/image information may further include information on various parameter sets such as an adaptation parameter set (APS), a picture parameter set (PPS), a sequence parameter set (SPS), a video parameter set (VPS) or the like. Further, the video/image information may further include general constraint information. In the present document, information and/or syntax elements which are transmitted/signaled to the decoding apparatus from the encoding apparatus may be incorporated in video/image information. The video/image information may be encoded through the above-described encoding procedure, and be incorporated in the bitstream. The bitstream may be transmitted through a network, or stored in a digital storage medium. Here, the network may include a broadcast network, a communication network and/or the like, and the digital storage medium may include various storage media such as USB, SD, CD, DVD, Blu-ray, HDD, SSD, and the like. A transmitter (not shown) which transmits a signal output from the entropy encoder 140 and/or a storage (not shown) which stores it may be configured as an internal/external element of the encoding apparatus 100, or the transmitter may be included in the entropy encoder 140.

Quantized transform coefficients output from the quantizer 133 may be used to generate a prediction signal. For example, by applying dequantization and inverse transform to quantized transform coefficients through the dequantizer 134 and the inverse transformer 135, the residual signal (residual block or residual samples) may be reconstructed. The adder 155 adds the reconstructed residual signal to a prediction signal output from the inter predictor 121 or the intra predictor 122, so that a reconstructed signal (reconstructed picture, reconstructed block, reconstructed sample array) may be generated. When there is no residual for a processing target block as in a case where the skip mode is applied, the predicted block may be used as a reconstructed block. The adder 150 may be called a reconstructor or a reconstructed block generator. The generated reconstruction signal may be used for intra prediction of a next processing target block in the current block, and as described later, may be used for inter prediction of a next picture through filtering.

Meanwhile, in the picture encoding and/or reconstructing process, luma mapping with chroma scaling (LMCS) may be applied.

The filter 160 may improve subjective/objective video quality by applying the filtering to the reconstructed signal. For example, the filter 160 may generate a modified reconstructed picture by applying various filtering methods to the reconstructed picture, and may store the modified reconstructed picture in the memory 170, specifically in the DPB of the memory 170. The various filtering methods may include, for example, deblocking filtering, sample adaptive offset, an adaptive loop filter, a bilateral filter or the like. As discussed later in the description of each filtering method, the filter 160 may generate various information relating to filtering, and transmit the generated information to the entropy encoder 140. The information on the filtering may be encoded in the entropy encoder 140 and output in the form of a bitstream.

The modified reconstructed picture which has been transmitted to the memory 170 may be used as a reference picture in the inter predictor 121. Through this, the encoding apparatus can avoid prediction mismatch in the encoding apparatus 100 and a decoding apparatus when the inter prediction is applied, and can also improve coding efficiency.

The memory 170 DPB may store the modified reconstructed picture in order to use it as a reference picture in the inter predictor 121. The memory 170 may store motion information of a block in the current picture, from which motion information has been derived (or encoded) and/or motion information of blocks in an already reconstructed picture. The stored motion information may be transmitted to the inter predictor 121 to be utilized as motion information of a neighboring block or motion information of a temporal neighboring block. The memory 170 may store reconstructed samples of reconstructed blocks in the current picture, and transmit them to the intra predictor 122.

FIG. 2 is a diagram schematically illustrating a configuration of a video/image decoding apparatus applicable to embodiments of this document.

Referring to FIG. 2 , the decoding apparatus 200 may include and be configured with an entropy decoder 210, a residual processor 220, a predictor 230, an adder 240, a filter 250 and a memory 260. The predictor 230 may include an inter predictor 232 and an intra predictor 231. The residual processor 220 may include a dequantizer 221 and an inverse transformer 221. The entropy decoder 210, the residual processor 220, the predictor 230, the adder 240, and the filter 250, which have been described above, may be configured by one or more hardware components (e.g., decoder chipsets or processors) according to an embodiment. Further, the memory 260 may include a decoded picture buffer (DPB), and may be constituted by a digital storage medium. The hardware component may further include the memory 260 as an internal/external component.

When a bitstream including video/image information is input, the decoding apparatus 200 may reconstruct an image correspondingly to a process by which video/image information has been processed in the encoding apparatus of FIG. 1 . For example, the decoding apparatus 200 may derive units/blocks based on information relating to block partition obtained from the bitstream. The decoding apparatus 200 may perform decoding by using a processing unit applied in the encoding apparatus. Therefore, the processing unit of decoding may be, for example, a coding unit, which may be partitioned along the quad-tree structure, the binary-tree structure, and/or the ternary-tree structure from a coding tree unit or a largest coding unit. One or more transform units may be derived from the coding unit. And, the reconstructed image signal decoded and output through the decoding apparatus 200 may be reproduced through a reproducer.

The decoding apparatus 200 may receive a signal output from the encoding apparatus of FIG. 1 in the form of a bitstream, and the received signal may be decoded through the entropy decoder 210. For example, the entropy decoder 210 may parse the bitstream to derive information (e.g., video/image information) required for image reconstruction (or picture reconstruction). The video/image information may further include information on various parameter sets such as an adaptation parameter set (APS), a picture parameter set (PPS), a sequence parameter set (SPS), a video parameter set (VPS) or the like. Further, the video/image information may further include general constraint information. The decoding apparatus may decode a picture further based on information on the parameter set and/or the general constraint information. In the present disclosure, signaled/received information and/or syntax elements, which will be described later, may be decoded through the decoding procedure and be obtained from the bitstream. For example, the entropy decoder 210 may decode information in the bitstream based on a coding method such as exponential Golomb encoding, CAVLC, CABAC, or the like, and may output a value of a syntax element necessary for image reconstruction and quantized values of a transform coefficient regarding a residual. More specifically, a CABAC entropy decoding method may receive a bin corresponding to each syntax element in a bitstream, determine a context model using decoding target syntax element information and decoding information of neighboring and decoding target blocks, or information of symbol/bin decoded in a previous step, predict bin generation probability according to the determined context model and perform arithmetic decoding of the bin to generate a symbol corresponding to each syntax element value. Here, the CABAC entropy decoding method may update the context model using information of a symbol/bin decoded for a context model of the next symbol/bin after determination of the context model. The prediction related information among informations decoded in the entropy decoder 210 may be provided to the predictor (inter predictor 232 and intra predictor 231), and residual values, that is, quantized transform coefficients, on which entropy decoding has been performed in the entropy decoder 210, and associated parameter information may be input to the residual processor 220. The residual processor 220 may derive a residual signal (residual block, residual samples, residual sample array). Further, information on filtering among informations decoded in the entropy decoder 210 may be provided to the filter 250. Meanwhile, a receiver (not shown) which receives a signal output from the encoding apparatus may further constitute the decoding apparatus 200 as an internal/external element, and the receiver may be a component of the entropy decoder 210. Meanwhile, the decoding apparatus according to the present document may be called a video/image/picture coding apparatus, and the decoding apparatus may be classified into an information decoder (video/image/picture information decoder) and a sample decoder (video/image/picture sample decoder). The information decoder may include the entropy decoder 210, and the sample decoder may include at least one of the dequantizer 221, the inverse transformer 222, the adder 240, the filter 250, the memory 260, the inter predictor 232, and the intra predictor 231.

The dequantizer 221 may output transform coefficients by dequantizing the quantized transform coefficients. The dequantizer 221 may rearrange the quantized transform coefficients in the form of a two-dimensional block. In this case, the rearrangement may perform rearrangement based on an order of coefficient scanning which has been performed in the encoding apparatus. The dequantizer 221 may perform dequantization on the quantized transform coefficients using quantization parameter (e.g., quantization step size information), and obtain transform coefficients.

The dequantizer 222 obtains a residual signal (residual block, residual sample array) by inverse transforming transform coefficients.

The predictor may perform prediction on the current block, and generate a predicted block including prediction samples for the current block. The predictor may determine whether intra prediction or inter prediction is applied to the current block based on the information on prediction output from the entropy decoder 210, and specifically may determine an intra/inter prediction mode.

The predictor 220 may generate a prediction signal based on various prediction methods to be described below. For example, for prediction on one block, the predictor may apply either intra prediction or inter prediction, and, as well, apply both of intra prediction and inter prediction at the same time. The latter may be called combined inter and intra prediction (CIIP). Further, the predictor may be based on an intra block copy (IBC) prediction mode, or a palette mode in order to perform prediction on a block. The IBC prediction mode or palette mode may be used for content image/video coding of a game or the like, such as screen content coding (SCC). The IBC basically performs prediction in a current picture, but it may be performed similarly to inter prediction in that it derives a reference block in a current picture. That is, the IBC may use at least one of inter prediction techniques described in the present document. The palette mode may be regarded as an example of intra coding or intra prediction. When the palette mode is applied, information on a palette table and a palette index may be included in the video/image information and signaled.

The intra predictor 231 may predict the current block by referring to the samples in the current picture. The referred samples may be located in the neighbor of or apart from the current block according to the prediction mode. In the intra prediction, prediction modes may include a plurality of non-directional modes and a plurality of directional modes. The intra predictor 231 may determine the prediction mode applied to the current block by using the prediction mode applied to the neighboring block.

The inter predictor 232 may derive a predicted block for the current block based on a reference block (reference sample array) specified by a motion vector on a reference picture. At this time, in order to reduce the amount of motion information transmitted in the inter prediction mode, the motion information may be predicted on a block, subblock, or sample basis based on correlation of motion information between the neighboring block and the current block. The motion information may include a motion vector and a reference picture index. The motion information may further include inter prediction direction (L0 prediction, L1 prediction, Bi prediction, etc.) information. In the case of inter prediction, the neighboring block may include a spatial neighboring block existing in the current picture and a temporal neighboring block existing in the reference picture. For example, the inter predictor 232 may configure a motion information candidate list based on neighboring blocks, and derive a motion vector and/or a reference picture index of the current block based on received candidate selection information. Inter prediction may be performed based on various prediction modes, and the information on prediction may include information indicating a mode of inter prediction for the current block.

The adder 240 adds obtained residual signal to a prediction signal (predicted block, predicted sample array) output from the predictor (inter predictor 232 and/or intra predictor 231), so that a reconstructed signal (reconstructed picture, reconstructed block, reconstructed sample array) may be generated. When there is no residual for a processing target block as in a case where the skip mode is applied, the predicted block may be used as a reconstructed block.

The adder 240 may be called a reconstructor or a reconstructed block generator. The generated reconstructed signal may be used for intra prediction of a next processing target block in the current block, and as described later, may be output through filtering or be used for inter prediction of a next picture.

Meanwhile, in the picture decoding process, luma mapping with chroma scaling (LMCS) may be applied.

The filter 250 may improve subjective/objective video quality by applying the filtering to the reconstructed signal. For example, the filter 250 may generate a modified reconstructed picture by applying various filtering methods to the reconstructed picture, and may transmit the modified reconstructed picture in the memory 260, specifically in the DPB of the memory 260. The various filtering methods may include, for example, deblocking filtering, sample adaptive offset, an adaptive loop filter, a bilateral filter or the like.

The (modified) reconstructed picture which has been stored in the DPB of the memory 260 may be used as a reference picture in the inter predictor 232. The memory 260 may store motion information of a block in the current picture, from which motion information has been derived (or decoded) and/or motion information of blocks in an already reconstructed picture. The stored motion information may be transmitted to the inter predictor 160 to be utilized as motion information of a neighboring block or motion information of a temporal neighboring block. The memory 260 may store reconstructed samples of reconstructed blocks in the current picture, and transmit them to the intra predictor 231.

In the present document, embodiments described in the filter 160, the inter predictor 121 and the intra predictor 122 of the encoding apparatus 100 may be similarly or correspondingly applied to the filter 250, the inter predictor 232 and the intra predictor 231 of the decoding apparatus 200.

As described above, prediction is performed in order to increase compression efficiency in performing video coding. Through this, a predicted block including prediction samples for a current block, which is a coding target block, may be generated. Here, the predicted block includes prediction samples in a space domain (or pixel domain). The predicted block may be identically derived in the encoding apparatus and the decoding apparatus, and the encoding apparatus may increase image coding efficiency by signaling to the decoding apparatus not original sample value of an original block itself but information on residual (residual information) between the original block and the predicted block. The decoding apparatus may derive a residual block including residual samples based on the residual information, generate a reconstructed block including reconstructed samples by adding the residual block to the predicted block, and generate a reconstructed picture including reconstructed blocks.

The residual information may be generated through transform and quantization procedures. For example, the encoding apparatus may derive a residual block between the original block and the predicted block, derive transform coefficients by performing a transform procedure on residual samples (residual sample array) included in the residual block, and derive quantized transform coefficients by performing a quantization procedure on the transform coefficients, so that it may signal associated residual information to the decoding apparatus (through a bitstream). Here, the residual information may include value information, position information, a transform technique, transform kernel, a quantization parameter or the like of the quantized transform coefficients. The decoding apparatus may perform a quantization/dequantization procedure and derive the residual samples (or residual sample block), based on residual information. The decoding apparatus may generate a reconstructed block based on a predicted block and the residual block. The encoding apparatus may derive a residual block by dequantizing/inverse transforming quantized transform coefficients for reference for inter prediction of a next picture, and may generate a reconstructed picture based on this.

FIG. 3 schematically illustrates a multiple transform technique according to an embodiment of the present disclosure.

Referring to FIG. 3 , a transformer may correspond to the transformer in the encoding apparatus of foregoing FIG. 1 , and an inverse transformer may correspond to the inverse transformer in the encoding apparatus of foregoing FIG. 1 , or to the inverse transformer in the decoding apparatus of FIG. 2 .

The transformer may derive (primary) transform coefficients by performing a primary transform based on residual samples (residual sample array) in a residual block (S410). This primary transform may be referred to as a core transform. Herein, the primary transform may be based on multiple transform selection (MTS), and when a multiple transform is applied as the primary transform, it may be referred to as a multiple core transform.

The multiple core transform may represent a method of transforming additionally using discrete cosine transform (DCT) type 2 and discrete sine transform (DST) type 7, DCT type 8, and/or DST type 1. That is, the multiple core transform may represent a transform method of transforming a residual signal (or residual block) of a space domain into transform coefficients (or primary transform coefficients) of a frequency domain based on a plurality of transform kernels selected from among the DCT type 2, the DST type 7, the DCT type 8 and the DST type 1. Herein, the primary transform coefficients may be called temporary transform coefficients from the viewpoint of the transformer.

In other words, when the conventional transform method is applied, transform coefficients might be generated by applying transform from a space domain to a frequency domain for a residual signal (or residual block) based on the DCT type 2. Unlike to this, when the multiple core transform is applied, transform coefficients (or primary transform coefficients) may be generated by applying transform from a space domain to a frequency domain for a residual signal (or residual block) based on the DCT type 2, the DST type 7, the DCT type 8, and/or DST type 1. Herein, the DCT type 2, the DST type 7, the DCT type 8, and the DST type 1 may be called a transform type, transform kernel or transform core. These DCT/DST transform types can be defined based on basis functions.

When the multiple core transform is performed, a vertical transform kernel and a horizontal transform kernel for a target block may be selected from among the transform kernels, a vertical transform may be performed on the target block based on the vertical transform kernel, and a horizontal transform may be performed on the target block based on the horizontal transform kernel. Here, the horizontal transform may indicate a transform on horizontal components of the target block, and the vertical transform may indicate a transform on vertical components of the target block. The vertical transform kernel/horizontal transform kernel may be adaptively determined based on a prediction mode and/or a transform index for the target block (CU or subblock) including a residual block.

Further, according to an example, if the primary transform is performed by applying the MTS, a mapping relationship for transform kernels may be set by setting specific basis functions to predetermined values and combining basis functions to be applied in the vertical transform or the horizontal transform. For example, when the horizontal transform kernel is expressed as trTypeHor and the vertical direction transform kernel is expressed as trTypeVer, a trTypeHor or trTypeVer value of 0 may be set to DCT2, a trTypeHor or trTypeVer value of 1 may be set to DST7, and a trTypeHor or trTypeVer value of 2 may be set to DCT8.

In this case, MTS index information may be encoded and signaled to the decoding apparatus to indicate any one of a plurality of transform kernel sets. For example, an MTS index of 0 may indicate that both trTypeHor and trTypeVer values are 0, an MTS index of 1 may indicate that both trTypeHor and trTypeVer values are 1, an MTS index of 2 may indicate that the trTypeHor value is 2 and the trTypeVer value. Is 1, an MTS index of 3 may indicate that the trTypeHor value is 1 and the trTypeVer value is 2, and an MTS index of 4 may indicate that both trTypeHor and trTypeVer values are 2.

In one example, transform kernel sets according to MTS index information are illustrated in the following table.

TABLE 1 tu_mts_idx[ x0 ][ y0 ] 0 1 2 3 4 trTypeHor 0 1 2 1 2 trTypeVer 0 1 1 2 2

The transformer may derive modified (secondary) transform coefficients by performing the secondary transform based on the (primary) transform coefficients (S420). The primary transform is a transform from a spatial domain to a frequency domain, and the secondary transform refers to transforming into a more compressive expression by using a correlation existing between (primary) transform coefficients. The secondary transform may include a non-separable transform. In this case, the secondary transform may be called a non-separable secondary transform (NSST), or a mode-dependent non-separable secondary transform (MDNSST). The non-separable secondary transform may represent a transform which generates modified transform coefficients (or secondary transform coefficients) for a residual signal by secondary-transforming, based on a non-separable transform matrix, (primary) transform coefficients derived through the primary transform. At this time, the vertical transform and the horizontal transform may not be applied separately (or horizontal and vertical transforms may not be applied independently) to the (primary) transform coefficients, but the transforms may be applied at once based on the non-separable transform matrix. In other words, the non-separable secondary transform may represent a transform method in which is not separately applied in the vertical direction and the horizontal direction for the (primary) transform coefficients, and for example, two-dimensional signals (transform coefficients) are re-arranged to a one-dimensional signal through a certain determined direction (e.g., row-first direction or column-first direction), and then modified transform coefficients (or secondary transform coefficients) are generated based on the non-separable transform matrix. For example, according to a row-first order, M×N blocks are disposed in a line in an order of a first row, a second row, . . . , and an Nth row. According to a column-first order, M×N blocks are disposed in a line in an order of a first column, a second column, . . . , and an Nth column. The non-separable secondary transform may be applied to a top-left region of a block configured with (primary) transform coefficients (hereinafter, may be referred to as a transform coefficient block). For example, if the width (W) and the height (H) of the transform coefficient block are all equal to or greater than 8, an 8×8 non-separable secondary transform may be applied to a top-left 8×8 region of the transform coefficient block. Further, if the width (W) and the height (H) of the transform coefficient block are all equal to or greater than 4, and the width (W) or the height (H) of the transform coefficient block is less than 8, then a 4×4 non-separable secondary transform may be applied to a top-left min(8, W)×min(8, H) region of the transform coefficient block. However, the embodiment is not limited to this, and for example, even if only the condition that the width (W) or height (H) of the transform coefficient block is equal to or greater than 4 is satisfied, the 4×4 non-separable secondary transform may be applied to the top-left min(8, W)×min(8, H) region of the transform coefficient block.

Specifically, for example, if a 4×4 input block is used, the non-separable secondary transform may be performed as follows.

The 4×4 input block X may be represented as follows.

$\begin{matrix} {X = \begin{bmatrix} X_{00} & X_{01} & X_{02} & X_{03} \\ X_{10} & X_{11} & X_{12} & X_{13} \\ X_{20} & X_{21} & X_{22} & X_{23} \\ X_{30} & X_{31} & X_{32} & X_{33} \end{bmatrix}} & \left\lbrack {{Equation}1} \right\rbrack \end{matrix}$

If the X is represented in the form of a vector, the vector {right arrow over (X)} may be represented as below.

{right arrow over (X)}=[X ₀₀ X ₀₁ X ₀₂ X ₀₃ X ₁₀ X ₁₁ X ₁₂ X ₁₃ X ₂₀ X ₂₁ X ₂₂ X ₂₃ X ₃₀ X ₃₁ X ₃₂ X ₃₃]^(T)  [Equation 2]

In Equation 2, the vector {right arrow over (X)} is a one-dimensional vector obtained by rearranging the two-dimensional block X of Equation 1 according to the row-first order.

In this case, the secondary non-separable transform may be calculated as below.

{right arrow over (F)}=T·{right arrow over (X)}  [Equation 3]

In this equation, {right arrow over (F)} represents a transform coefficient vector, and T represents a 16×16 (non-separable) transform matrix.

Through foregoing Equation 3, a 16×1 transform coefficient vector F may be derived, and the F may be re-organized into a 4×4 block through a scan order (horizontal, vertical, diagonal and the like). However, the above-described calculation is an example, and hypercube-Givens transform (HyGT) or the like may be used for the calculation of the non-separable secondary transform in order to reduce the computational complexity of the non-separable secondary transform.

Meanwhile, in the non-separable secondary transform, a transform kernel (or transform core, transform type) may be selected to be mode dependent. In this case, the mode may include the intra prediction mode and/or the inter prediction mode.

As described above, the non-separable secondary transform may be performed based on an 8×8 transform or a 4×4 transform determined based on the width (W) and the height (H) of the transform coefficient block. The 8×8 transform refers to a transform that is applicable to an 8×8 region included in the transform coefficient block when both W and H are equal to or greater than 8, and the 8×8 region may be a top-left 8×8 region in the transform coefficient block. Similarly, the 4×4 transform refers to a transform that is applicable to a 4×4 region included in the transform coefficient block when both W and H are equal to or greater than 4, and the 4×4 region may be a top-left 4×4 region in the transform coefficient block. For example, an 8×8 transform kernel matrix may be a 64×64/16×64 matrix, and a 4×4 transform kernel matrix may be a 16×16/8×16 matrix.

Here, to select a mode-dependent transform kernel, two non-separable secondary transform kernels per transform set for a non-separable secondary transform may be configured for both the 8×8 transform and the 4×4 transform, and there may be four transform sets. That is, four transform sets may be configured for the 8×8 transform, and four transform sets may be configured for the 4×4 transform. In this case, each of the four transform sets for the 8×8 transform may include two 8×8 transform kernels, and each of the four transform sets for the 4×4 transform may include two 4×4 transform kernels.

However, as the size of the transform, that is, the size of a region to which the transform is applied, may be, for example, a size other than 8×8 or 4×4, the number of sets may be n, and the number of transform kernels in each set may be k.

The transform set may be referred to as an NSST set or an LFNST set. A specific set among the transform sets may be selected, for example, based on the intra prediction mode of the current block (CU or subblock). A low-frequency non-separable transform (LFNST) may be an example of a reduced non-separable transform, which will be described later, and represents a non-separable transform for a low frequency component.

For reference, for example, the intra prediction mode may include two non-directional (or non-angular) intra prediction modes and 65 directional (or angular) intra prediction modes. The non-directional intra prediction modes may include a planar intra prediction mode of No. 0 and a DC intra prediction mode of No. 1, and the directional intra prediction modes may include 65 intra prediction modes of Nos. 2 to 66. However, this is an example, and this document may be applied even when the number of intra prediction modes is different. Meanwhile, in some cases, intra prediction mode No. 67 may be further used, and the intra prediction mode No. 67 may represent a linear model (LM) mode.

FIG. 4 exemplarily shows intra directional modes of 65 prediction directions.

Referring to FIG. 4 , on the basis of intra prediction mode 34 having a left upward diagonal prediction direction, the intra prediction modes may be divided into intra prediction modes having horizontal directionality and intra prediction modes having vertical directionality. In FIG. 4 , H and V denote horizontal directionality and vertical directionality, respectively, and numerals −32 to 32 indicate displacements in 1/32 units on a sample grid position. These numerals may represent an offset for a mode index value. Intra prediction modes 2 to 33 have the horizontal directionality, and intra prediction modes 34 to 66 have the vertical directionality. Strictly speaking, intra prediction mode 34 may be considered as being neither horizontal nor vertical, but may be classified as belonging to the horizontal directionality in determining a transform set of a secondary transform. This is because input data is transposed to be used for a vertical direction mode symmetrical on the basis of intra prediction mode 34, and an input data alignment method for a horizontal mode is used for intra prediction mode 34. Transposing input data means that rows and columns of two-dimensional M×N block data are switched into N×M data. Intra prediction mode 18 and intra prediction mode 50 may represent a horizontal intra prediction mode and a vertical intra prediction mode, respectively, and intra prediction mode 2 may be referred to as a right upward diagonal intra prediction mode because intra prediction mode 2 has a left reference pixel and performs prediction in a right upward direction. Likewise, intra prediction mode 34 may be referred to as a right downward diagonal intra prediction mode, and intra prediction mode 66 may be referred to as a left downward diagonal intra prediction mode.

According to an example, the four transform sets according to the intra prediction mode may be mapped, for example, as shown in the following table.

TABLE 2 predModeIntra IfnstTrSetIdx   predModeIntra < 0 1 0 <= predModeIntra <= 1 0  2 <= predModeIntra <= 12 1 13 <= predModeIntra <= 23 2 24 <= predModeIntra <= 44 3 45 <= predModeIntra <= 55 2 56 <= predModeIntra <= 80 1

As shown in Table 2, any one of the four transform sets, that is, lfnstTrSetIdx, may be mapped to any one of four indexes, that is, 0 to 3, according to the intra prediction mode.

When it is determined that a specific set is used for the non-separable transform, one of k transform kernels in the specific set may be selected through a non-separable secondary transform index. An encoding apparatus may derive a non-separable secondary transform index indicating a specific transform kernel based on a rate-distortion (RD) check and may signal the non-separable secondary transform index to a decoding apparatus. The decoding apparatus may select one of the k transform kernels in the specific set based on the non-separable secondary transform index. For example, lfnst index value 0 may refer to a first non-separable secondary transform kernel, lfnst index value 1 may refer to a second non-separable secondary transform kernel, and lfnst index value 2 may refer to a third non-separable secondary transform kernel. Alternatively, lfnst index value 0 may indicate that the first non-separable secondary transform is not applied to the target block, and first index values 1 to 3 may indicate the three transform kernels.

The transformer may perform the non-separable secondary transform based on the selected transform kernels, and may obtain modified (secondary) transform coefficients. As described above, the modified transform coefficients may be derived as transform coefficients quantized through the quantizer, and may be encoded and signaled to the decoding apparatus and transferred to the dequantizer/inverse transformer in the encoding apparatus.

Meanwhile, as described above, if the secondary transform is omitted, (primary) transform coefficients, which are an output of the primary (separable) transform, may be derived as transform coefficients quantized through the quantizer as described above, and may be encoded and signaled to the decoding apparatus and transferred to the dequantizer/inverse transformer in the encoding apparatus.

The inverse transformer may perform a series of procedures in the inverse order to that in which they have been performed in the above-described transformer. The inverse transformer may receive (dequantized) transformer coefficients, and derive (primary) transform coefficients by performing a secondary (inverse) transform (S450), and may obtain a residual block (residual samples) by performing a primary (inverse) transform on the (primary) transform coefficients (S460). In this connection, the primary transform coefficients may be called modified transform coefficients from the viewpoint of the inverse transformer. As described above, the encoding apparatus and the decoding apparatus may generate the reconstructed block based on the residual block and the predicted block, and may generate the reconstructed picture based on the reconstructed block.

The decoding apparatus may further include a secondary inverse transform application determinator (or an element to determine whether to apply a secondary inverse transform) and a secondary inverse transform determinator (or an element to determine a secondary inverse transform). The secondary inverse transform application determinator may determine whether to apply a secondary inverse transform. For example, the secondary inverse transform may be an NSST, an RST, or an LFNST and the secondary inverse transform application determinator may determine whether to apply the secondary inverse transform based on a secondary transform flag obtained by parsing the bitstream. In another example, the secondary inverse transform application determinator may determine whether to apply the secondary inverse transform based on a transform coefficient of a residual block.

The secondary inverse transform determinator may determine a secondary inverse transform. In this case, the secondary inverse transform determinator may determine the secondary inverse transform applied to the current block based on an LFNST (NSST or RST) transform set specified according to an intra prediction mode. In an embodiment, a secondary transform determination method may be determined depending on a primary transform determination method. Various combinations of primary transforms and secondary transforms may be determined according to the intra prediction mode. Further, in an example, the secondary inverse transform determinator may determine a region to which a secondary inverse transform is applied based on the size of the current block.

Meanwhile, as described above, if the secondary (inverse) transform is omitted, (dequantized) transform coefficients may be received, the primary (separable) inverse transform may be performed, and the residual block (residual samples) may be obtained. As described above, the encoding apparatus and the decoding apparatus may generate the reconstructed block based on the residual block and the predicted block, and may generate the reconstructed picture based on the reconstructed block.

Meanwhile, in the present disclosure, a reduced secondary transform (RST) in which the size of a transform matrix (kernel) is reduced may be applied in the concept of NSST in order to reduce the amount of computation and memory required for the non-separable secondary transform.

Meanwhile, the transform kernel, the transform matrix, and the coefficient constituting the transform kernel matrix, that is, the kernel coefficient or the matrix coefficient, described in the present disclosure may be expressed in 8 bits. This may be a condition for implementation in the decoding apparatus and the encoding apparatus, and may reduce the amount of memory required to store the transform kernel with a performance degradation that can be reasonably accommodated compared to the existing 9 bits or 10 bits. In addition, the expressing of the kernel matrix in 8 bits may allow a small multiplier to be used, and may be more suitable for single instruction multiple data (SIMD) instructions used for optimal software implementation.

In the present specification, the term “RST” may mean a transform which is performed on residual samples for a target block based on a transform matrix whose size is reduced according to a reduced factor. In the case of performing the reduced transform, the amount of computation required for transform may be reduced due to a reduction in the size of the transform matrix. That is, the RST may be used to address the computational complexity issue occurring at the non-separable transform or the transform of a block of a great size.

RST may be referred to as various terms, such as reduced transform, reduced secondary transform, reduction transform, simplified transform, simple transform, and the like, and the name which RST may be referred to as is not limited to the listed examples. Alternatively, since the RST is mainly performed in a low frequency region including a non-zero coefficient in a transform block, it may be referred to as a Low-Frequency Non-Separable Transform (LFNST). The transform index may be referred to as an LFNST index.

Meanwhile, when the secondary inverse transform is performed based on RST, the inverse transformer 135 of the encoding apparatus 100 and the inverse transformer 222 of the decoding apparatus 200 may include an inverse reduced secondary transformer which derives modified transform coefficients based on the inverse RST of the transform coefficients, and an inverse primary transformer which derives residual samples for the target block based on the inverse primary transform for the modified transform coefficients. The inverse primary transform refers to the inverse transform of the primary transform applied to the residual. In the present disclosure, deriving a transform coefficient based on a transform may refer to deriving a transform coefficient by applying the transform.

FIG. 5 is a diagram illustrating an RST according to an embodiment of the present disclosure.

In the present disclosure, a “target block” may refer to a current block to be coded, a residual block, or a transform block.

In the RST according to an example, an N-dimensional vector may be mapped to an R-dimensional vector located in another space, so that the reduced transform matrix may be determined, where R is less than N. N may mean the square of the length of a side of a block to which the transform is applied, or the total number of transform coefficients corresponding to a block to which the transform is applied, and the reduced factor may mean an R/N value. The reduced factor may be referred to as a reduced factor, reduction factor, simplified factor, simple factor or other various terms. Meanwhile, R may be referred to as a reduced coefficient, but according to circumstances, the reduced factor may mean R. Further, according to circumstances, the reduced factor may mean the N/R value.

In an example, the reduced factor or the reduced coefficient may be signaled through a bitstream, but the example is not limited to this. For example, a predefined value for the reduced factor or the reduced coefficient may be stored in each of the encoding apparatus 100 and the decoding apparatus 200, and in this case, the reduced factor or the reduced coefficient may not be signaled separately.

The size of the reduced transform matrix according to an example may be R×N less than N×N, the size of a conventional transform matrix, and may be defined as in Equation 4 below.

$\begin{matrix} {T_{RxN} = \begin{bmatrix} t_{11} & t_{12} & t_{13} & \ldots & t_{1N} \\ t_{21} & t_{22} & t_{23} & & t_{2N} \\  & \vdots & & \ddots & \vdots \\ t_{R1} & t_{R2} & t_{R3} & \ldots & t_{RN} \end{bmatrix}} & \left\lbrack {{Equation}4} \right\rbrack \end{matrix}$

The matrix T in the Reduced Transform block shown in FIG. 5(a) may mean the matrix T_(R×N) of Equation 4. As shown in FIG. 5(a), when the reduced transform matrix T_(R×N) is multiplied to residual samples for the target block, transform coefficients for the target block may be derived.

In an example, if the size of the block to which the transform is applied is 8×8 andR=16 (i.e., R/N= 16/64=¼), then the RST according to FIG. 5(a) may be expressed as a matrix operation as shown in Equation 5 below. In this case, memory and multiplication calculation can be reduced to approximately ¼ by the reduced factor.

In the present disclosure, a matrix operation may be understood as an operation of multiplying a column vector by a matrix, disposed on the left of the column vector, to obtain a column vector.

$\begin{matrix} {\begin{bmatrix} t_{1,1} & t_{1,2} & t_{1,3} & \ldots & t_{1,64} \\ t_{2,1} & t_{2,2} & t_{2,3} & & t_{2,64} \\  & \vdots & & \ddots & \vdots \\ t_{16,1} & t_{16,2} & t_{16,3} & \ldots & t_{16,64} \end{bmatrix} \times \begin{bmatrix} r_{1} \\ r_{2} \\  \vdots \\ r_{64} \end{bmatrix}} & \left\lbrack {{Equation}5} \right\rbrack \end{matrix}$

In Equation 5, r₁ to r₆₄ may represent residual samples for the target block and may be specifically transform coefficients generated by applying a primary transform. As a result of the calculation of Equation 5 transform coefficients ci for the target block may be derived, and a process of deriving ci may be as in Equation 6.

  [Equation 6] for i from to R:   ci = 0   for j from 1 to N    ci + = tij * rj

As a result of the calculation of Equation 6, transform coefficients c₁ to c_(R) for the target block may be derived. That is, when R=16, transform coefficients c₁ to c₁₆ for the target block may be derived. If, instead of RST, a regular transform is applied and a transform matrix of 64×64 (N×N) size is multiplied to residual samples of 64×1 (N×1) size, then only 16 (R) transform coefficients are derived for the target block because RST was applied, although 64 (N) transform coefficients are derived for the target block. Since the total number of transform coefficients for the target block is reduced from N to R, the amount of data transmitted by the encoding apparatus 100 to the decoding apparatus 200 decreases, so efficiency of transmission between the encoding apparatus 100 and the decoding apparatus 200 can be improved.

When considered from the viewpoint of the size of the transform matrix, the size of the regular transform matrix is 64×64 (N×N), but the size of the reduced transform matrix is reduced to 16×64 (R×N), so memory usage in a case of performing the RST can be reduced by an R/N ratio when compared with a case of performing the regular transform. In addition, when compared to the number of multiplication calculations N×N in a case of using the regular transform matrix, the use of the reduced transform matrix can reduce the number of multiplication calculations by the R/N ratio (R×N).

In an example, the transformer 132 of the encoding apparatus 100 may derive transform coefficients for the target block by performing the primary transform and the RST-based secondary transform on residual samples for the target block. These transform coefficients may be transferred to the inverse transformer of the decoding apparatus 200, and the inverse transformer 222 of the decoding apparatus 200 may derive the modified transform coefficients based on the inverse reduced secondary transform (RST) for the transform coefficients, and may derive residual samples for the target block based on the inverse primary transform for the modified transform coefficients.

The size of the inverse RST matrix T_(N×R) according to an example is N×R less than the size N×N of the regular inverse transform matrix, and is in a transpose relationship with the reduced transform matrix T_(R×N) shown in Equation 4.

The matrix T^(t) in the Reduced Inv. Transform block shown in FIG. 5(b) may mean the inverse RST matrix T_(R×N) ^(T) (the superscript T means transpose). When the inverse RST matrix T_(R×N) ^(T) is multiplied to the transform coefficients for the target block as shown in FIG. 5(b), the modified transform coefficients for the target block or the residual samples for the current block may be derived. The inverse RST matrix T_(R×N) ^(T) may be expressed as (T_(R×N) ^(T))_(N×R).

More specifically, when the inverse RST is applied as the secondary inverse transform, the modified transform coefficients for the target block may be derived when the inverse RST matrix T_(R×N) ^(T) is multiplied to the transform coefficients for the target block. Meanwhile, the inverse RST may be applied as the inverse primary transform, and in this case, the residual samples for the target block may be derived when the inverse RST matrix T_(R×N) ^(T) is multiplied to the transform coefficients for the target block.

In an example, if the size of the block to which the inverse transform is applied is 8×8 and R=16 (i.e., R/N= 16/64=¼), then the RST according to FIG. 5(b) may be expressed as a matrix operation as shown in Equation 7 below.

$\begin{matrix} {\begin{bmatrix} \begin{matrix} t_{1,1} & t_{2,1} \end{matrix} & & t_{16,1} \\ \begin{matrix} t_{1,2} & t_{2,2} \end{matrix} & \ldots & t_{16,2} \\ \begin{matrix} t_{1,3} & t_{2,3} \end{matrix} & & t_{16,3} \\ \begin{matrix}  \vdots & \vdots  \end{matrix} & & \vdots \\  \vdots & \ddots & \vdots \\ \begin{matrix} t_{1,64} & t_{2,64} \end{matrix} & \ldots & t_{16,64} \end{bmatrix} \times \begin{bmatrix} c_{1} \\ c_{2} \\  \vdots \\ c_{16} \end{bmatrix}} & \left\lbrack {{Equation}7} \right\rbrack \end{matrix}$

In Equation 7, c₁ to c₁₆ may represent the transform coefficients for the target block. As a result of the calculation of Equation 7, r_(i) representing the modified transform coefficients for the target block or the residual samples for the target block may be derived, and the process of deriving r_(i) may be as in Equation 8.

  [Equation 8] For i from 1 to N  r_(i) = 0   for j from 1 to R    r_(i) + = t_(ji) * c_(j)

As a result of the calculation of Equation 8, r₁ to r_(N) representing the modified transform coefficients for the target block or the residual samples for the target block may be derived. When considered from the viewpoint of the size of the inverse transform matrix, the size of the regular inverse transform matrix is 64×64 (N×N), but the size of the reduced inverse transform matrix is reduced to 64×16 (R×N), so memory usage in a case of performing the inverse RST can be reduced by an R/N ratio when compared with a case of performing the regular inverse transform. In addition, when compared to the number of multiplication calculations N×N in a case of using the regular inverse transform matrix, the use of the reduced inverse transform matrix can reduce the number of multiplication calculations by the R/N ratio (N×R).

A transform set configuration shown in Table 2 may also be applied to an 8×8 RST. That is, the 8×8 RST may be applied according to a transform set in Table 2. Since one transform set includes two or three transforms (kernels) according to an intra prediction mode, it may be configured to select one of up to four transforms including that in a case where no secondary transform is applied. In a transform where no secondary transform is applied, it may be considered to apply an identity matrix. Assuming that indexes 0, 1, 2, and 3 are respectively assigned to the four transforms (e.g., index 0 may be allocated to a case where an identity matrix is applied, that is, a case where no secondary transform is applied), a transform index or an lfnst index as a syntax element may be signaled for each transform coefficient block, thereby designating a transform to be applied. That is, for a top-left 8×8 block, through the transform index, it is possible to designate an 8×8 RST in an RST configuration, or to designate an 8×8 lfnst when the LFNST is applied. The 8×8 lfnst and the 8×8 RST refer to transforms applicable to an 8×8 region included in the transform coefficient block when both W and H of the target block to be transformed are equal to or greater than 8, and the 8×8 region may be a top-left 8×8 region in the transform coefficient block. Similarly, a 4×4 lfnst and a 4×4 RST refer to transforms applicable to a 4×4 region included in the transform coefficient block when both W and H of the target block to are equal to or greater than 4, and the 4×4 region may be a top-left 4×4 region in the transform coefficient block.

According to an embodiment of the present disclosure, for a transform in an encoding process, only 48 pieces of data may be selected and a maximum 16×48 transform kernel matrix may be applied thereto, rather than applying a 16×64 transform kernel matrix to 64 pieces of data forming an 8×8 region. Here, “maximum” means that m has a maximum value of 16 in an m×48 transform kernel matrix for generating m coefficients. That is, when an RST is performed by applying an m×48 transform kernel matrix (m≤16) to an 8×8 region, 48 pieces of data are input and m coefficients are generated. When m is 16, 48 pieces of data are input and 16 coefficients are generated. That is, assuming that 48 pieces of data form a 48×1 vector, a 16×48 matrix and a 48×1 vector are sequentially multiplied, thereby generating a 16×1 vector. Here, the 48 pieces of data forming the 8×8 region may be properly arranged, thereby forming the 48×1 vector. For example, a 48×1 vector may be constructed based on 48 pieces of data constituting a region excluding the bottom right 4×4 region among the 8×8 regions. Here, when a matrix operation is performed by applying a maximum 16×48 transform kernel matrix, 16 modified transform coefficients are generated, and the 16 modified transform coefficients may be arranged in a top-left 4×4 region according to a scanning order, and a top-right 4×4 region and a bottom-left 4×4 region may be filled with zeros.

For an inverse transform in a decoding process, the transposed matrix of the foregoing transform kernel matrix may be used. That is, when an inverse RST or LFNST is performed in the inverse transform process performed by the decoding apparatus, input coefficient data to which the inverse RST is applied is configured in a one-dimensional vector according to a predetermined arrangement order, and a modified coefficient vector obtained by multiplying the one-dimensional vector and a corresponding inverse RST matrix on the left of the one-dimensional vector may be arranged in a two-dimensional block according to a predetermined arrangement order.

In summary, in the transform process, when an RST or LFNST is applied to an 8×8 region, a matrix operation of 48 transform coefficients in top-left, top-right, and bottom-left regions of the 8×8 region excluding the bottom-right region among transform coefficients in the 8×8 region and a 16×48 transform kernel matrix. For the matrix operation, the 48 transform coefficients are input in a one-dimensional array. When the matrix operation is performed, 16 modified transform coefficients are derived, and the modified transform coefficients may be arranged in the top-left region of the 8×8 region.

On the contrary, in the inverse transform process, when an inverse RST or LFNST is applied to an 8×8 region, 16 transform coefficients corresponding to a top-left region of the 8×8 region among transform coefficients in the 8×8 region may be input in a one-dimensional array according to a scanning order and may be subjected to a matrix operation with a 48×16 transform kernel matrix. That is, the matrix operation may be expressed as (48×16 matrix)*(16×1 transform coefficient vector)=(48×1 modified transform coefficient vector). Here, an n×1 vector may be interpreted to have the same meaning as an n×1 matrix and may thus be expressed as an n×1 column vector. Further, * denotes matrix multiplication. When the matrix operation is performed, 48 modified transform coefficients may be derived, and the 48 modified transform coefficients may be arranged in top-left, top-right, and bottom-left regions of the 8×8 region excluding a bottom-right region.

When a secondary inverse transform is based on an RST, the inverse transformer 135 of the encoding apparatus 100 and the inverse transformer 222 of the decoding apparatus 200 may include an inverse reduced secondary transformer to derive modified transform coefficients based on an inverse RST on transform coefficients and an inverse primary transformer to derive residual samples for the target block based on an inverse primary transform on the modified transform coefficients. The inverse primary transform refers to the inverse transform of a primary transform applied to a residual. In the present disclosure, deriving a transform coefficient based on a transform may refer to deriving the transform coefficient by applying the transform.

The above-described non-separated transform, the LFNST, will be described in detail as follows. The LFNST may include a forward transform by the encoding apparatus and an inverse transform by the decoding apparatus.

The encoding apparatus receives a result (or a part of a result) derived after applying a primary (core) transform as an input, and applies a forward secondary transform (secondary transform).

y=G ^(T) _(x)  [Equation 9]

In Equation 9, x and y are inputs and outputs of the secondary transform, respectively, and G is a matrix representing the secondary transform, and transform basis vectors are composed of column vectors. In the case of an inverse LFNST, when the dimension of the transformation matrix G is expressed as [number of rows×number of columns], in the case of an forward LFNST, the transposition of matrix G becomes the dimension of G^(T).

For the inverse LFNST, the dimensions of matrix G are [48×16], [48×8], [16×16], [16×8], and the [48×8] matrix and the [16×8] matrix are partial matrices that sampled 8 transform basis vectors from the left of the [48×16] matrix and the [16×16] matrix, respectively.

On the other hand, for the forward LFNST, the dimensions of matrix G^(T) are[16×48], [8×48], [16×16], [8×16], and the [8×48] matrix and the [8×16] matrix are partial matrices obtained by sampling 8 transform basis vectors from the top of the [16×48] matrix and the [16×16] matrix, respectively.

Therefore, in the case of the forward LFNST, a [48×1] vector or [16×1] vector is possible as an input x, and a [16×1] vector or a [8×1] vector is possible as an output y. In video coding and decoding, the output of the forward primary transform is two-dimensional (2D) data, so to construct the [48×1] vector or the [16×1] vector as the input x, a one-dimensional vector must be constructed by properly arranging the 2D data that is the output of the forward transformation.

FIG. 6 is a diagram illustrating a sequence of arranging output data of a forward primary transformation into a one-dimensional vector according to an example. The left diagrams of (a) and (b) of FIG. 6 show the sequence for constructing a [48×1] vector, and the right diagrams of (a) and (b) of FIG. 6 shows the sequence for constructing a [16×1] vector. In the case of the LFNST, a one-dimensional vector x can be obtained by sequentially arranging 2D data in the same order as in (a) and (b) of FIG. 6 .

The arrangement direction of the output data of the forward primary transform may be determined according to an intra prediction mode of the current block. For example, when the intra prediction mode of the current block is in the horizontal direction with respect to the diagonal direction, the output data of the forward primary transform may be arranged in the order of (a) of FIG. 6 , and when the intra prediction mode of the current block is in the vertical direction with respect to the diagonal direction, the output data of the forward primary transform may be arranged in the order of (b) of FIG. 6 .

According to an example, an arrangement order different from the arrangement orders of (a) and (b) FIG. 6 may be applied, and in order to derive the same result (y vector) as when the arrangement orders of (a) and (b) FIG. 6 is applied, the column vectors of the matrix G may be rearranged according to the arrangement order. That is, it is possible to rearrange the column vectors of G so that each element constituting the x vector is always multiplied by the same transform basis vector.

Since the output y derived through Equation 9 is a one-dimensional vector, when two-dimensional data is required as input data in the process of using the result of the forward secondary transformation as an input, for example, in the process of performing quantization or residual coding, the output y vector of Equation 9 must be properly arranged as 2D data again.

FIG. 7 is a diagram illustrating a sequence of arranging output data of a forward secondary transform into a two-dimensional block according to an example.

In the case of the LFNST, output values may be arranged in a 2D block according to a predetermined scan order. (a) of FIG. 7 shows that when the output y is a [16×1] vector, the output values are arranged at 16 positions of the 2D block according to a diagonal scan order. (b) of FIG. 7 shows that when the output y is a [8×1] vector, the output values are arranged at 8 positions of the 2D block according to the diagonal scan order, and the remaining 8 positions are filled with zeros. X in (b) of FIG. 7 indicates that it is filled with zero.

According to another example, since the order in which the output vector y is processed in performing quantization or residual coding may be preset, the output vector y may not be arranged in the 2D block as shown in FIG. 7 . However, in the case of the residual coding, data coding may be performed in 2D block (eg, 4×4) units such as CG (Coefficient Group), and in this case, the data are arranged according to a specific order as in the diagonal scan order of FIG. 7 .

Meanwhile, the decoding apparatus may configure the one-dimensional input vector y by arranging two-dimensional data output through a dequantization process or the like according to a preset scan order for the inverse transformation. The input vector y may be output as the output vector x by the following equation.

x=Gy  [Equation 10]

In the case of the inverse LFNST, an output vector x can be derived by multiplying an input vector y, which is a [16×1] vector or a [8×1] vector, by a G matrix. For the inverse LFNST, the output vector x can be either a [48×1] vector or a [16×1] vector.

The output vector x is arranged in a two-dimensional block according to the order shown in FIG. 6 and is arranged as two-dimensional data, and this two-dimensional data becomes input data (or a part of input data) of the inverse primary transformation.

Accordingly, the inverse secondary transformation is the opposite of the forward secondary transformation process as a whole, and in the case of the inverse transformation, unlike in the forward direction, the inverse secondary transformation is first applied, and then the inverse primary transformation is applied.

In the inverse LFNST, one of 8 [48×16] matrices and 8 [16×16] matrices may be selected as the transformation matrix G. Whether to apply the [48×16] matrix or the [16×16] matrix depends on the size and shape of the block.

In addition, 8 matrices may be derived from four transform sets as shown in Table 2 above, and each transform set may consist of two matrices. Which transform set to use among the 4 transform sets is determined according to the intra prediction mode, and more specifically, the transform set is determined based on the value of the intra prediction mode extended by considering the Wide Angle Intra Prediction (WAIP). Which matrix to select from among the two matrices constituting the selected transform set is derived through index signaling. More specifically, 0, 1, and 2 are possible as the transmitted index value, 0 may indicate that the LFNST is not applied, and 1 and 2 may indicate any one of two transform matrices constituting a transform set selected based on the intra prediction mode value.

Meanwhile, as described above, which transform matrix of the [48×16] matrix and the [16×16] matrix is applied to the LFNST is determined by the size and shape of the transform target block.

FIG. 8 is a diagram illustrating a block shape to which the LFNST is applied. (a) of FIG. 8 shows 4×4 blocks, (b) shows 4×8 and 8×4 blocks, (c) shows 4×N or N×4 blocks in which N is 16 or more, (d) shows 8×8 blocks, (e) shows M×N blocks where M≥8, N≥8, and N>8 or M>8.

In FIG. 8 , blocks with thick borders indicate regions to which the LFNST is applied. For the blocks of FIGS. 10 (a) and (b), the LFNST is applied to the top-left 4×4 region, and for the block of FIG. 8 (c), the LFNST is applied individually the two top-left 4×4 regions are continuously arranged. In (a), (b), and (c) of FIG. 8 , since the LFNST is applied in units of 4×4 regions, this LFNST will be hereinafter referred to as “4×4 LFNST”. Based on the matrix dimension for G, a [16×16] or [16×8] matrix may be applied.

More specifically, the [16×8] matrix is applied to the 4×4 block (4×4 TU or 4×4 CU) of FIG. 8 (a) and the [16×16] matrix is applied to the blocks in (b) and (c) of FIG. 8 . This is to adjust the computational complexity for the worst case to 8 multiplications per sample.

With respect to (d) and (e) of FIG. 8 , the LFNST is applied to the top-left 8×8 region, and this LFNST is hereinafter referred to as “8×8 LFNST”. As a corresponding transformation matrix, a [48×16] matrix or [48×8] matrix may be applied. In the case of the forward LFNST, since the [48×1] vector (x vector in Equation 9) is input as input data, all sample values of the top-left 8×8 region are not used as input values of the forward LFNST. That is, as can be seen in the left order of FIG. 6 (a) or the left order of FIG. 6 (b), the [48×1] vector may be constructed based on samples belonging to the remaining 3 4×4 blocks while leaving the bottom-right 4×4 block as it is.

The [48×8] matrix may be applied to an 8×8 block (8×8 TU or 8×8 CU) in FIG. 8 (d), and the [48×16] matrix may be applied to the 8×8 block in FIG. 8(e). This is also to adjust the computational complexity for the worst case to 8 multiplications per sample.

Depending on the block shape, when the corresponding forward LFNST (4×4 LFNST or 8×8 LFNST) is applied, 8 or 16 output data (y vector in Equation 9, [8×1] or [16×1] vector) is generated. In the forward LFNST, the number of output data is equal to or less than the number of input data due to the characteristics of the matrix G^(T).

FIG. 9 is a diagram illustrating an arrangement of output data of a forward LFNST according to an example, and shows a block in which output data of the forward LFNST is arranged according to a block shape.

The shaded area at the top-left of the block shown in FIG. 9 corresponds to the area where the output data of the forward LFNST is located, the positions marked with 0 indicate samples filled with 0 values, and the remaining area represents regions that are not changed by the forward LFNST. In the area not changed by the LFNST, the output data of the forward primary transform remains unchanged.

As described above, since the dimension of the transform matrix applied varies according to the shape of the block, the number of output data also varies. As FIG. 9 , the output data of the forward LFNST may not completely fill the top-left 4×4 block. In the case of (a) and (d) of FIG. 9 , a [16×8] matrix and a [48×8] matrix are applied to the block indicated by a thick line or a partial region inside the block, respectively, and a [8×1] vector as the output of the forward LFNST is generated. That is, according to the scan order shown in (b) of FIG. 7 , only 8 output data may be filled as shown in (a) and (d) of FIGS. 9 , and 0 may be filled in the remaining 8 positions. In the case of the LFNST applied block of FIG. 8 (d), as shown in FIG. 9(d), two 4×4 blocks in the top-right and bottom-left adjacent to the top-left 4×4 block are also filled with 0 values.

As described above, basically, by signaling the LFNST index, whether to apply the LFNST and the transform matrix to be applied are specified. As shown FIG. 9 , when the LFNST is applied, since the number of output data of the forward LFNST may be equal to or less than the number of input data, a region filled with a zero value occurs as follows.

1) As shown in (a) of FIG. 9 , samples from the 8th and later positions in the scan order in the top-left 4×4 block, that is, samples from the 9th to the 16th.

2) As shown in (d) and (e) of FIG. 9 , when the [48×16] matrix or the [48×8] matrix is applied, two 4×4 blocks adjacent to the top-left 4×4 block or the second and third 4×4 blocks in the scan order.

Therefore, if non-zero data exists by checking the areas 1) and 2), it is certain that the LFNST is not applied, so that the signaling of the corresponding LFNST index can be omitted.

According to an example, for example, in the case of LFNST adopted in the VVC standard, since signaling of the LFNST index is performed after the residual coding, the encoding apparatus may know whether there is the non-zero data (significant coefficients) for all positions within the TU or CU block through the residual coding. Accordingly, the encoding apparatus may determine whether to perform signaling on the LFNST index based on the existence of the non-zero data, and the decoding apparatus may determine whether the LFNST index is parsed. When the non-zero data does not exist in the area designated in 1) and 2) above, signaling of the LFNST index is performed.

Meanwhile, for the adopted LFNST, the following simplification methods may be applied.

(i) According to an example, the number of output data for the forward LFNST may be limited to a maximum of 16.

In the case of (c) of FIG. 8 , the 4×4 LFNST may be applied to two 4×4 regions adjacent to the top-left, respectively, and in this case, a maximum of 32 LFNST output data may be generated. when the number of output data for forward LFNST is limited to a maximum of 16, in the case of 4×N/N×4 (N≥16) blocks (TU or CU), the 4×4 LFNST is only applied to one 4×4 region in the top-left, the LFNST may be applied only once to all blocks of FIG. 8 . Through this, the implementation of image coding may be simplified.

(ii) According to an example, zero-out may be additionally applied to a region to which the LFNST is not applied. In this document, the zero-out may mean filling values of all positions belonging to a specific region with a value of 0. That is, the zero-out can be applied to a region that is not changed due to the LFNST and maintains the result of the forward primary transformation. As described above, since the LFNST is divided into the 4×4 LFNST and the 8×8 LFNST, the zero-out can be divided into two types ((ii)-(A) and (ii)-(B)) as follows.

(ii)-(A) When a 4×4 LFNST is applied, a region to which the 4×4 LFNST is not applied may be zeroed out. FIG. 10 illustrates zeroing-out in a block to which a 4×4 LFNST is applied according to an example.

As shown in FIG. 10 , with respect to the block to which the 4×4 LFNST is applied, that is, with respect to the blocks in (a), (b), and (c) of FIG. 9 , even a region to which no LFNST is applied may be filled with 0s.

(d) of FIG. 10 shows that zeroing-out is performed on a remaining block to which the 4×4 LFNST is not applied when the maximum number of pieces of output data of the forward LFNST is limited to 16 according to an example.

(ii)-(B) When an 8×8 LFNST is applied, a region to which the 8×8 LFNST is not applied may be zeroed out. FIG. 11 illustrates zeroing-out in a block to which an 8×8 LFNST is applied according to an example.

As shown in FIG. 11 , with respect to the block to which the 8×8 LFNST is applied, that is, with respect to the blocks in (d) and (e) of FIG. 9 , even a region to which no LFNST is applied may be filled with 0s.

(iii) Due to the zeroing-out proposed in (ii), when the LFNST is applied, a region filled with 0s may change. Accordingly, according to the zeroing-out proposed in (ii), whether non-zero data exists may be checked over a wider region than in the LFNST of FIG. 9 .

For example, when (ii)-(B) is applied, whether non-zero data exists may be checked in up to a region additionally filled with 0s in FIG. 11 in addition to the regions filled with 0s in FIG. (d) and (e) of FIG. 9 , and then an LFNST index may be signaled only when non-zero data does not exist.

Of course, even if the zero-out proposed in (ii) is applied, it is possible to check whether the non-zero data exists in the same way as the existing LFNST index signaling. That is, after checking whether the non-zero data exists in the block filled with zeros in FIG. 9 , the LFNST index signaling may be applied. In this case, the encoding apparatus only performs the zero out and the decoding apparatus does not assume the zero out, that is, checking only whether the non-zero data exists only in the area explicitly marked as 0 in FIG. 9 , may perform the LFNST index parsing.

Various embodiments in which combinations of the simplification methods ((i), (ii)-(A), (ii)-(B), (iii)) for the LFNST are applied may be derived. Of course, the combinations of the above simplification methods are not limited to the following embodiment, and any combination may be applied to the LFNST.

EMBODIMENT

-   -   Limit the number of output data for forward LFNST to a maximum         of 16→(i)     -   When the 4×4 LFNST is applied, all areas to which the 4×4 LFNST         is not applied are zero-out→(ii)-(A)     -   When the 8×8 LFNST is applied, all areas to which the 8×8 LFNST         is not applied are zero-out→(ii)-(B)     -   After checking whether the non-zero data exists also the         existing area filled with zero value and the area filled with         zeros due to additional zero outs ((ii)-(A), (ii)-(B)), the         LFNST index is signaled only when the non-zero data does not         exist→(iii)

In the embodiment, when the LFNST is applied, a region in which non-zero output data can exist is limited to the inside of a top-left 4×4 region. Specifically, in (a) of FIG. 10 and (a) of FIG. 11 , an eighth position in a scan order is the last position where non-zero data can exist, and in (b) and (d) of FIG. 10 and (b) of FIG. 11 , a sixteenth position in the scan order (i.e., a bottom-right position of a top-left 4×4 block) is the last position where non-zero data can exist.

Therefore, when the LFNST is applied, after checking whether the non-zero data exists in a position where the residual coding process is not allowed (at a position beyond the last position), it can be determined whether the LFNST index is signaled.

In the case of the zero-out method proposed in (ii), since the number of data finally generated when both the primary transform and the LFNST are applied, the amount of computation required to perform the entire transformation process can be reduced. That is, when the LFNST is applied, since zero-out is applied to the forward primary transform output data existing in a region to which the LFNST is not applied, there is no need to generate data for the region that become zero-out during performing the forward primary transform. Accordingly, it is possible to reduce the amount of computation required to generate the corresponding data. The additional effects of the zero-out method proposed in (ii) are summarized as follows.

First, as described above, the amount of computation required to perform the entire transform process is reduced.

In particular, when (ii)-(B) is applied, the amount of calculation for the worst case is reduced, so that the transform process can be lightened. In other words, in general, a large amount of computation is required to perform a large-size primary transformation. By applying (ii)-(B), the number of data derived as a result of performing the forward LFNST can be reduced to 16 or less. In addition, as the size of the entire block (TU or CU) increases, the effect of reducing the amount of transform operation is further increased.

Second, the amount of computation required for the entire transform process can be reduced, thereby reducing the power consumption required to perform the transform.

Third, the latency involved in the transform process is reduced.

The secondary transformation such as the LFNST adds a computational amount to the existing primary transformation, thus increasing the overall delay time involved in performing the transformation. In particular, in the case of intra prediction, since reconstructed data of neighboring blocks is used in the prediction process, during encoding, an increase in latency due to a secondary transformation leads to an increase in latency until reconstruction. This can lead to an increase in overall latency of intra prediction encoding.

However, if the zero-out suggested in (ii) is applied, the delay time of performing the primary transform can be greatly reduced when LFNST is applied, the delay time for the entire transform is maintained or reduced, so that the encoding apparatus can be implemented more simply.

Meanwhile, in the conventional intra prediction, a coding target block is regarded as one coding unit, and coding is performed without partition thereof. However, the ISP (Intra Sub-Paritions) coding refers to performing the intra prediction coding with the coding target block being partitioned in a horizontal direction or a vertical direction. In this case, a reconstructed block may be generated by performing encoding/decoding in units of partitioned blocks, and the reconstructed block may be used as a reference block of the next partitioned block. According to an example, in the ISP coding, one coding block may be partitioned into two or four sub-blocks and be coded, and in the ISP, intra prediction is performed on one sub-block by referring to the reconstructed pixel value of a sub-block located adjacent to the left or top side thereof. Hereinafter, the term “coding” may be used as a concept including both coding performed by the encoding apparatus and decoding performed by the decoding apparatus.

The ISP partitions a block predicted as luma intra into two or four sub-partitionings in a vertical direction or a horizontal direction according to the size of the block. For example, the minimum block size to which the ISP can be applied is 4×8 or 8×4. If the block size is greater than 4×8 or 8×4, the block is partitioned into four sub-partitionings.

When the ISP is applied, the sub-blocks are sequentially coded according to the partition type, such as, horizontally or vertically, from left to right, or from top to bottom, and coding for the next sub-block may be performed after performing up to a restoration process through inverse transform and intra prediction for one sub-block. For the leftmost or uppermost sub-block, as in a conventional intra prediction method, the reconstructed pixel of the coding block which has been already coded is referred to. Additionally, if the previous sub-block is not adjacent to each side of an internal sub-block that follows it, in order to derive reference pixels adjacent to a corresponding side, as in the conventional intra prediction method, the reconstructed pixel of an already coded adjacent coding block is referred to.

In an ISP coding mode, all subblocks may be coded with the same intra prediction mode, and a flag indicating whether to use ISP coding and a flag indicating a direction (horizontal or vertical) in which partition is performed may be signaled. Here, the number of subblocks may be adjusted to 2 or 4 depending on a block shape. When the size (width×height) of one subblock is less than 16, partition into the subblocks may not be allowed, or a restriction may be put not to apply ISP coding itself.

Meanwhile, in the case of ISP prediction mode, one coding unit is partitioned into two or four partition blocks, that is, sub-blocks, and predicted, and the same intra prediction mode is applied to the thus partitioned two or four partition blocks.

As described above, both a horizontal direction (if an M×N coding unit having a horizontal length and a vertical length of M and N, respectively, is divided in the horizontal direction, it is divided into M×(N/2) blocks when divided into two, and into an M×(N/4) blocks when divided into four) and a vertical direction (if the M×N coding unit is divided in the vertical direction, it is divided into (M/2)×N blocks when divided into two, and divided into (M/4)×N blocks when divided into four) are possible as the partition direction. When partitioned in the horizontal direction, partition blocks are coded in an order from top to down, and when partitioned in the vertical direction, partition blocks are coded in an order from left to right. The currently coded partition block may be predicted by referring to the reconstructed pixel values of the top (left) partition block in the case of the horizontal (vertical) direction partition.

Transformation may be applied to the residual signal generated by the ISP prediction method in units of partition blocks. MTS (Multiple Transform Selection) technology based on the DST-7/DCT-8 combination as well as the existing DCT-2 may be applied to the primary transform (core transform or primary transform) based on the forward direction, and an LFNST (Low Frequency Non-Separable Transform) may be applied to a transform coefficient generated according to the primary transform to generate a final modified transform coefficient.

That is, LFNST may also be applied to partition blocks divided by applying the ISP prediction mode, and the same intra prediction mode is applied to the divided partition blocks as described above. Accordingly, when selecting the LFNST set derived based on the intra prediction mode, the derived LFNST set may be applied to all partition blocks. That is, the same intra prediction mode is applied to all partition blocks, and thereby the same LFNST set may be applied to all partition blocks.

Meanwhile, according to an example, the LFNST may be applied only to transform blocks having both a horizontal and vertical length of 4 or more. Therefore, when the horizontal or vertical length of the partition block partitioned according to the ISP prediction method is less than 4, the LFNST is not applied and the LFNST index is not signaled. Additionally, when the LFNST is applied to each partition block, the corresponding partition block may be regarded as one transform block. Of course, when the ISP prediction method is not applied, the LFNST may be applied to the coding block.

Application of the LFNST to each partition block is described in detail as follows.

According to an example, after applying the forward LFNST to an individual partition block, and after leaving only up to 16 coefficients (8 or 16) in the top-left 4×4 region according to the transform coefficient scanning order, zero-out of filling all remaining positions and regions with a value of 0 may be applied.

Alternatively, according to an example, when the length of one side of the partition block is 4, the LFNST is applied only to the top-left 4×4 region, and when the length of all sides of the partition block, that is, the width and height, are 8 or more, the LFNST may be applied to the remaining 48 coefficients except for a bottom-right 4×4 region in a top-left 8×8 region.

Alternatively, according to an example, in order to adjust the computational complexity of the worst case to 8 multiplications per sample, when each partition block is 4×4 or 8×8, only 8 transform coefficients may be output after applying the forward LFNST. That is, if the partition block is 4×4, an 8×16 matrix may be applied as a transform matrix, and if the partition block is 8×8, an 8×48 matrix may be applied as a transform matrix.

Meanwhile, in the current VVC standard, LFNST index signaling is performed in units of coding units. Accordingly, when the ISP prediction mode is used and the LFNST is applied to all partition blocks, then the same LFNST index value may be applied to the corresponding partition blocks. That is, when the LFNST index value is transmitted once at the coding unit level, the corresponding LFNST index may be applied to all partition blocks in the coding unit. As described above, the LFNST index value may have values of 0, 1, and 2, 0 indicates a case in which the LFNST is not applied, and 1 and 2 indicate two transform matrices present in one LFNST set when the LFNST is applied.

As described above, the LFNST set is determined by the intra prediction mode, and since all partition blocks in the coding unit are predicted in the same intra prediction mode in the case of the ISP prediction mode, the partition blocks may refer to the same LFNST set.

As another example, the LFNST index signaling is still performed in units of coding units, but in the case of the ISP prediction mode, without determining whether or not to apply the LFNST uniformly to all partition blocks, whether to apply the LFNST index value signaled at the coding unit level to each partition block or not to apply the LFNST may be determined through a separate condition. Here, the separate condition may be signaled in the form of a flag for each partition block through the bitstream, and when the flag value is 1, the LFNST index value signaled at the coding unit level may be applied, and when the flag value is 0, the LFNST may not be applied.

Hereinafter, a method for maintaining the computational complexity for the worst case when LFNST is applied to the ISP mode will be described.

In the case of ISP mode, in order to maintain the number of multiplications per sample (or per coefficient, or per position) at a certain value or less when LFNST is applied, the application of LFNST may be restricted. Depending on the size of the partition block, the number of multiplications per sample (or per coefficient, or per position) may be maintained at 8 or less by applying LFNST as follows.

1. When both the horizontal length and the vertical length of the partition block are equal to or greater than 4, the same method as the calculation complexity adjustment method for the worst case for LFNST in the current VVC standard may be applied.

That is, when the partition block is a 4×4 block, instead of a 16×16 matrix, in the forward direction, an 8×16 matrix obtained by sampling the top 8 rows from a 16×16 matrix may be applied, and in the backward direction, a 16×8 matrix obtained by sampling the left 8 columns from a 16×16 matrix may be applied. Additionally, when the partition block is an 8×8 block, in the forward direction, instead of a 16×48 matrix, an 8×48 matrix obtained by sampling the top 8 rows from a 16×48 matrix may be applied, and in the backward direction, instead of a 48×16 matrix, a 48×8 matrix obtained by sampling the left 8 columns from a 48×16 matrix may be applied.

In the case of a 4×N or N×4 (N>4) block, when forward transform is performed, 16 coefficients generated after applying a 16×16 matrix only to the top-left 4×4 block are arranged in the top-left 4×4 region, and the other regions may be filled with 0 values. Additionally, when performing inverse transform, 16 coefficients located in the top-left 4×4 block may be arranged in the scanning order to configure an input vector, and then 16 output data may be generated by multiplying the 16×16 matrix. The generated output data may be arranged in the top-left 4×4 region, and the remaining regions except for the top-left 4×4 region may be filled with zeros.

In the case of an 8×N or N×8 (N>8) block, when the forward transformation is performed, 16 coefficients generated after applying the 16×48 matrix only to the ROI region in the top-left 8×8 block (remaining regions excluding the bottom-right 4×4 block from the top-left 8×8 block) may be arranged in the top-left 4×4 area, and the other regions may be filled with 0 values. Additionally, when performing inverse transform, 16 coefficients located in the top-left 4×4 block may be arranged in the scanning order to configure an input vector, and then 48 output data may be generated by multiplying the 48×16 matrix. The generated output data may be filled in the ROI region, and the other regions may be filled with 0 values.

As another example, in order to maintain the number of multiplications per sample (or per coefficient, or per position) at a certain value or less, the number of multiplications per sample (or per coefficient, or per position) based on the ISP coding unit size rather than the size of the ISP partition block may be maintained at 8 or less. If there is only one block among the ISP partition blocks, which satisfies the condition under which the LFNST is applied, the complexity calculation for the worst case of LFNST may be applied based on the corresponding coding unit size rather than the size of the partition block. For example, when a luma coding block for a certain coding unit is partitioned into 4 partition blocks of 4×4 size and coded by the ISP, and when no non-zero transform coefficient exists for two partition blocks among them, the other two partition blocks may be respectively set to generate 16 transform coefficients instead of 8 (based on the encoder).

Hereinafter, a method of signaling the LFNST index in the case of the ISP mode will be described.

As described above, the LFNST index may have values of 0, 1, and 2, where 0 indicates that the LFNST is not applied, and 1 and 2 respectively indicate either one of two LFNST kernel matrices included in the selected LFNST set. The LFNST is applied based on the LFNST kernel matrix selected by the LFNST index. A method of transmitting the LFNST index in the current VVC standard will be described as follows.

1. An LFNST index may be transmitted once for each coding unit (CU), and in the case of a dual-tree, individual LFNST indexes may be signaled for a luma block and a chroma block, respectively.

2. When the LFNST index is not signaled, the LFNST index value is inferred to be a default value of 0. The case where the LFNST index value is inferred to be 0 is as follows.

A. In the case of a mode in which no transform is applied (e.g., transform skip, BDPCM, lossless coding, etc.)

B. When the primary transform is not DCT-2 (DST7 or DCT8), that is, when the transform in the horizontal direction or the transform in the vertical direction is not DCT-2

C. When the horizontal length or vertical length for the luma block of the coding unit exceeds the size of the transformable maximum luma transform, for example, when the size of the transformable maximum luma transform is 64, and when the size for the luma block of the coding block is equal to 128×16, the LFNST cannot be applied.

In the case of the dual tree, it is determined whether or not the size of the maximum luma transform is exceeded for each of the coding unit for the luma component and the coding unit for the chroma component. That is, it is checked for the luma block whether or not the size of the maximum transformable luma transform is exceeded, and it is checked for the chroma block whether or not the horizontal/vertical length of the corresponding luma block for the color format and the size of the maximum transformable luma transform exceed the size are exceeded. For example, when the color format is 4:2:0, the horizontal/vertical length of the corresponding luma block is twice that of the corresponding chroma block, and the transform size of the corresponding luma block is twice that of the corresponding chroma block. As another example, when the color format is 4:4:4, the horizontal/vertical length and transform size and of the corresponding luma block are the same as those of the corresponding chroma block.

A 64-length transform or a 32-length transform may mean a transform applied to width or height having a length of 64 or 32, respectively, and “transform size” may mean 64 or 32 as the corresponding length.

In the case of a single tree, after checking whether or not a horizontal length or a vertical length of a luma block exceeds the maximum transformable luma transform block size, if it exceeds, the LFNST index signaling may be omitted.

D. The LFNST index may be transmitted only when both the horizontal length and the vertical length of the coding unit are equal to or greater than 4.

In the case of a dual tree, the LFNST index may be signaled only when both the horizontal and vertical lengths for a corresponding component (i.e., a luma or chroma component) are equal to or greater than 4.

In the case of a single tree, the LFNST index may be signaled when both the horizontal and vertical lengths for the luma component are equal to or greater than 4.

E. If the position of the last non-zero coefficient is not a DC position (top-left position of the block), and if the position of the last non-zero coefficient is not a DC position, in the case of a luma block of a dual tree type, the LFNST index is transmitted. In the case of a dual tree type chroma block, if any one of the position of the last non-zero coefficient for Cb and the position of the last non-zero coefficient for Cr is not a DC position, the corresponding LNFST index is transmitted.

In the case of the single tree type, if the position of the last non-zero coefficient of any one of the luma component, Cb component, and Cr component is not the DC position, the LFNST index is transmitted.

Here, if a coded block flag (CBF) value indicating whether or not a transform coefficient for one transform block exists is 0, the position of the last non-zero coefficient for the corresponding transform block is not checked in order to determine whether or not the LFNST index is signaled. That is, when the corresponding CBF value is 0, since no transform is applied to the corresponding block, the position of the last non-zero coefficient may not be considered when checking the condition for the LFNST index signaling.

For example, 1) in the case of a dual tree type and a luma component, if the corresponding CBF value is 0, the LFNST index is not signaled, 2) in the case of a dual tree type and chroma component, if the CBF value for Cb is 0 and the CBF value for Cr is 1, only the position of the last non-zero coefficient for Cr is checked and the corresponding LFNST index is transmitted, 3) in the case of a single tree type, the position of the last non-zero coefficient is checked only for components having a CBF value of 1 for each of luma, Cb, and Cr.

F. When it is confirmed that the transform coefficient exists at a position other than a position where the LFNST transform coefficient may exist, the LFNST index signaling may be omitted. In the case of a 4×4 transform block and an 8×8 transform block, LFNST transform coefficients may exist at eight positions from the DC position according to the transform coefficient scanning order in the VVC standard, and the remaining positions are filled with zeros. Additionally, when the 4×4 transform block and the 8×8 transform block are not, LFNST transform coefficients may exist in sixteen positions from the DC position according to the transform coefficient scanning order in the VVC standard, and the remaining positions are filled with zeros.

Accordingly, if the non-zero transform coefficients exists in the region which should be filled with the zero value after progressing the residual coding, the LFNST index signaling may be omitted.

Meanwhile, the ISP mode may also be applied only to the luma block, or may be applied to both the luma block and the chroma block. As described above, when ISP prediction is applied, the corresponding coding unit may be divided into two or four partition blocks and predicted, and a transform may be applied to each of the partition blocks. Therefore, also when determining a condition for signaling the LFNST index in units of coding units, it is necessary to take into consideration the fact that the LFNST may be applied to respective partition blocks. In addition, when the ISP prediction mode is applied only to a specific component (e.g., a luma block), the LFNST index must be signaled in consideration of the fact that only the component is divided into partition blocks. The LFNST index signaling methods available in the ISP mode are summarized as follows.

1. An LFNST index may be transmitted once for each coding unit (CU), and in the case of a dual-tree, individual LFNST indexes may be signaled for a luma block and a chroma block, respectively.

2. When the LFNST index is not signaled, the LFNST index value is inferred to be a default value of 0. The case where the LFNST index value is inferred to be 0 is as follows.

A. In the case of a mode in which no transform is applied (e.g., transform skip, BDPCM, lossless coding, etc.)

B. When the horizontal length or vertical length for the luma block of the coding unit exceeds the size of the transformable maximum luma transform, for example, when the size of the transformable maximum luma transform is 64, and when the size for the luma block of the coding block is equal to 128×16, the LFNST cannot be applied.

Whether or not to signal the LFNST index may be determined based on the size of the partition block instead of the coding unit. That is, if the horizontal or vertical length of the partition block for the corresponding luma block exceeds the size of the transformable maximum luma transformation, the LFNST index signaling may be omitted and the LFNST index value may be inferred to be 0.

In the case of the dual tree, it is determined whether or not the size of the maximum luma transform is exceeded for each of the coding unit or partition block for the luma component and the coding unit or partition block for the chroma component. That is, if the horizontal and vertical lengths of the coding unit or partition block for luma are compared with the maximum luma transform size, respectively, and at least one of them is greater than the maximum luma transform size, the LFNST is not applied, and in the case of a coding unit or partition block for chroma, the horizontal/vertical length of the corresponding luma block for the color format and the size of the maximum transformable luma transform are compared. For example, when the color format is 4:2:0, the horizontal/vertical length of the corresponding luma block is twice that of the corresponding chroma block, and the transform size of the corresponding luma block is twice that of the corresponding chroma block. As another example, when the color format is 4:4:4, the horizontal/vertical length and transform size and of the corresponding luma block are the same as those of the corresponding chroma block.

In the case of a single tree, after checking whether or not a horizontal length or a vertical length for a luma block (coding unit or partition block) exceeds the maximum transformable luma transform block size, if it exceeds, the LFNST index signaling may be omitted.

C. If the LFNST included in the current VVC standard is applied, the LFNST index may be transmitted only when both the horizontal length and the vertical length of the partition block are equal to or greater than 4.

If the LFNST for the 2×M (1×M) or M×2 (M×1) block is applied in addition to the LFNST included in the current VVC standard, the LFNST index may be transmitted only when the size of the partition block is equal to or larger than a 2×M (1×M) or M×2 (M×1) block. Here, the expression “the P×Q block is equal to or greater than the R×S block” means that P≥R and Q≥S.

In summary, the LFNST index can be transmitted only when the partition block is equal to or greater than the minimum size to which the LFNST is applicable. In the case of a dual tree, the LFNST index can be signaled only when the partition block for the luma or chroma component is equal to or larger than the minimum size to which the LFNST is applicable. In the case of a single tree, the LFNST index can be signaled only when the partition block for the luma component is equal to or larger than the minimum size to which LFNST is applicable.

In this document, the expression “the M×N block is greater than or equal to the K×L block” means that M is greater than or equal to K and N is greater than or equal to L. The expression “the M×N block is larger than the K×L block” means that M is greater than or equal to K and N is greater than or equal to L, and that M is greater than K or N is greater than L. The expression “the M×N block less than or equal to the K×L block” means that M is less than or equal to K and N is less than or equal to L, while the expression “the M×N block is smaller than the K×L block” means that M is less than or equal to K and N is less than or equal to L, and that M is less than K or N is less than L.

D. If the position of the last non-zero coefficient is not a DC position (top-left position of the block), and if the position of the last non-zero coefficient is not a DC position in any one of all partition blocks In the case of a dual tree type luma block, the LFNST index is transmitted. In the case of a dual tree type and a chroma block, if at least one of the position of the last non-zero coefficient of all partition blocks for Cb (if the ISP mode is not applied to the chroma component, the number of partition blocks is considered to be one) and the position of the last non-zero coefficient of all partition blocks for Cr (if the ISP mode is not applied to the chroma component, the number of partition blocks is considered to be one) is not a DC position, the corresponding LNFST index may be transmitted.

In the case of the single tree type, if the position of the last non-zero coefficient of any one of all partition blocks for the luma component, the Cb component and the Cr component is not the DC position, the corresponding LFNST index may be transmitted.

Here, if the value of the coded block flag (CBF) indicating whether a transform coefficient exists for each partition block is 0, the position of the last non-zero coefficient for the corresponding partition block is not checked in order to determine whether or not the LFNST index is signaled. That is, when the corresponding CBF value is 0, since no transform is applied to the corresponding block, the position of the last non-zero coefficient for the corresponding partition block is not considered when checking the condition for the LFNST index signaling.

For example, 1) in the case of a dual tree type and a luma component, if the corresponding CBF value for each partition block is 0, the partition block is excluded when determining whether or not to signal the LFNST index, 2) in the case of a dual tree type and a chroma component, if the CBF value for Cb is 0 and the CBF value for Cr is 1 for each partition block, only the position of the last non-zero coefficient for Cr is checked to determine whether or not to signal the LFNST index, 3) in the case of the single tree type, it is possible to determine whether or not to signal the LFNST index by checking the position of the last non-zero coefficient only for blocks having a CBF value of 1 for all partition blocks of the luma component, the Cb component, and the Cr component.

In the case of the ISP mode, image information may also be configured so that the position of the last non-zero coefficient is not checked, and an embodiment thereof is as follows.

i. In the case of the ISP mode, the LFNST index signaling may be allowed without checking the position of the last non-zero coefficient for both the luma block and the chroma block. That is, even if the position of the last non-zero coefficient for all partition blocks is the DC position or the corresponding CBF value is 0, the LFNST index signaling may be allowed.

ii. In the case of the ISP mode, the checking of the position of the last non-zero coefficient only for the luma block may be omitted, and in the case of the chroma block, the checking of the position of the last non-zero coefficient may be performed in the above-described manner. For example, in the case of a dual tree type and a luma block, the LFNST index signaling is allowed without checking the position of the last non-zero coefficient, and in the case of a dual tree type and a chroma block, whether or not a corresponding LFNST index is signaled may be determined by checking whether or not a DC position exists for the position of the last non-zero coefficient in the above-described manner.

iii. In the case of the ISP mode and the single tree type, the i or ii method may be applied. That is, in the case of the ISP mode and when the number i is applied to the single tree type, it is possible to omit the checking of the position of the last non-zero coefficient for both the luma block and the chroma block and allow LFNST index signaling. Alternatively, by applying section ii, for the partition blocks for the luma component, the checking of the position of the last non-zero coefficient is omitted, and for the partition blocks for the chroma component (if ISP is not applied for the chroma component, the number of partition blocks can be considered as 1), the position of the last non-zero coefficient is checked in the above-described manner, thereby determining whether or not to signal the LFNST index.

E. When it is confirmed that the transform coefficient exists at a position other than a position where the LFNST transform coefficient may exist even for one partition block among all partition blocks, the LFNST index signaling may be omitted.

For example, in the case of a 4×4 partition block and an 8×8 partition block, LFNST transform coefficients may exist at eight positions from the DC position according to the transform coefficient scanning order in the VVC standard, and the remaining positions are filled with zeros. Additionally, if it is equal to or greater than 4×4 and is not a 4×4 partition block nor an 8×8 partition block, LFNST transform coefficients may exist at 16 positions from the DC position according to the transform coefficient scanning order in the VVC standard, and all the remaining positions are filled with zeros.

Accordingly, if the non-zero transform coefficients exists in the region which should be filled with the zero value after progressing the residual coding, the LFNST index signaling may be omitted.

Meanwhile, in the case of the ISP mode, the length condition is independently viewed for the horizontal direction and the vertical direction, and DST-7 is applied instead of DCT-2 without signaling for the MTS index. It is determined whether or not the horizontal or vertical length is greater than or equal to 4 and less than or equal to 16, and a primary transform kernel is determined according to the determination result. Accordingly, in the case of the ISP mode, when the LFNST can be applied, the following transform combination configuration is possible.

1. When the LFNST index is 0 (including the case in which the LFNST index is inferred as 0), the primary transform decision condition at the time of the ISP included in the current VVC standard may be followed. In other words, it may be checked whether or not the length condition (being equal to or greater than 4 or equal to or less than 16) is independently satisfied for the horizontal and vertical directions, respectively, and if it is satisfied, DST-7 may be applied instead of DCT-2 for primary transform, while, if it is not satisfied, DCT-2 may be applied.

2. For a case in which the LFNST index is greater than 0, the following two configurations may be possible as a primary transform.

A. DCT-2 can be applied to both horizontal and vertical directions.

B. The primary transform decision condition at the time of the ISP included in the current VVC standard may be followed. In other words, it may be checked whether or not the length condition (being equal to or greater than 4 or equal to or less than 16) is independently satisfied for the horizontal and vertical directions, respectively, and if it is satisfied, DST-7 may be applied instead of DCT-2, while, if it is not satisfied, DCT-2 may be applied.

In the ISP mode, image information may be configured such that the LFNST index is transmitted for each partition block rather than for each coding unit. In this case, in the above-described LFNST index signaling method, it may be regarded that only one partition block exists in a unit in which the LFNST index is transmitted, and it may be determined whether or not to signal the LFNST index.

Hereinafter, signaling of an LFNST index and an MTS index is described.

A coding unit syntax table, a transform unit syntax table, and a residual coding syntax table related to signaling of an LFNST index and an MTS index according to an example are shown as below. According to Table 3, the MTS index moves from a transform unit level syntax to a coding unit level syntax, and is signaled after the LFNST index is signaled. Further, a constraint of not allowing an LFNST when an ISP is applied to a coding unit is removed. Since the constraint of not allowing the LFNST when the ISP is applied to the coding unit is removed, the LFNST may be applied to all intra prediction blocks. In addition, both the MTS index and the LFNST index are conditionally signaled at the end in a coding unit level.

TABLE 3 coding_unit x0, y0, cbWidth, cbHeight, cqtDepth, treeType, mode Type ) { ...   LfnstDcOnly = 1   LfnstZeroOutSigCoeffFlag = 1   MtsZeroOutSigCoeffFlag = 1   transform_tree( x0, y0, cbWidth, cbHeight, treeType )   lfnstWidth = ( treeType  = =  DUAL_TREE_CHROMA ) ? cbWidth / SubWidthC :          ( IntraSubPartitionsSplitType  = = ISP_VER_SPLIT) ? cbWidth / NumIntraSubPartitions : cbWidth   lfnstHeight = ( treeType  = =  DUAL_TREE_CHROMA) ? cbHeight / SubHeightC :          ( IntraSubPartitionsSplitType  = = ISP_HOR_SPLIT) ? cbHeight / NumIntraSubPartitions : cbHeight   if( Min( lfnstWidth, lfnstHeight )  >= 4  &&  sps_lfnst_enabled_flag  = =  1  &&    CuPredMode[ chType ][ x0 ][ y0 ]  = =  MODE_INTRA  &&    ( lintra_mip_flag[ x0 ][ y0 ]  | |  Min( lfnstWidth, lfnstHeight )  >=  16 )  &&   Max( cbWidth, cbHeight )  <=  MaxTbSizeY) {    if( ( IntraSubPartitionsSplitType 1   = ISP_NO_SPLIT | | LfstDcOnly  = =  0) && LfnstZerOutSigCoeffFlag  = =  1)     ifnst_idx[ x0 ][ y0 ]   }   if treeType   !=   DUAL_TREE_CHROMA &&   lfist_idx[x0][y0] = =   0   &&    transform_skip_flag[x0 ][ y0]  = =  0   && Max( cbWidth, cbHeight)  <=   32   &&    IntraSubPartitionsSplit[ x0 ][ y0 ] = = ISP_NO_SPLIT && ( lcu_sbt_flag ) &&    MtsZerOutSigCoeffFlag   = =   1 && tu_cbf_luma[ x0 ][ y0 ] ) {    if( ( ( CuPredMode[ chType ][ x0 ][ y0 ] = = MODE_INTER &&     sps_explicit_mts_inter_enabled_flag )     | | ( CuPredMode[ chType ][ x0 ][ y0 ] = = MODE_INTRA &&     sps_explicit_mis_intra__enabled_flag ) ) )     mts_idx[ x0 ][ y0 ]   } ...

TABLE 4 transform_unit( x0, y0, tbWidth, tbHeight, treeType, subTuIndex, chType ) { ...  if( tu_cbf_luma[ x0 ][ y0 ] && treeType != DUAL_TREE_CHROMA   && ( tbWidth <= 32 ) && ( tbHeight <= 32 )   && (IntraSubPartitionsSplit[ x0 ][ y0 ] = = ISP_NO_SPLIT) && ( !cu_sbt_flag ) ) {   if( sps_transform_skip_enabled_flag && !BdpomFlag[ x0 ][ y0 ] &&    tbWidth  <=  MaxTsSize && tbHeight  <=  MaxTsSize)    transform_skip_flag[ x0 ][ y0 ]  } ...

TABLE 5 residual_coding( x0, y0, log2TbWidth, log2TbHeight, cIdx } { ...  if ( ( cu_sbt_flag && log2TbWidth < 6 && log2TbHeight < 6 )     && cIdx = = 0 && log2TbWidth > 4)   log2ZoTbWidth = 4  else   log2ZoTbWidth = Min( log2TbWidth, 5 )  MaxCcbs = 2 * ( 1 << log2TbWidth ) * ( 1<< log2TbHeight )  if ( ( cu_sbt_flag && log2TbWidth < 6 && log2TbHeight < 6 )     && cIdx = = 0 && log2TbHeight > 4 )   log2ZoTbHeight = 4  else   log2ZoTbHeight = Min( log2TbHeight, 5 ) ...  if( (lastSubBlock > 0 && log2TbWidth >= 2 && log2TbHeight >= 2 )  | |   ( lastScanPos > 7 && ( log2TbWidth = = 2 | | log2TbWidth = = 3 ) &&   log2TbWidth = = log2TbHeight ) )   LfnstZeroOutSigCoeffFlag = 0  if( ( LastSignificantCoeffX > 15 | | LastSignificantCoeffY > 15 ) && cIdx = = 0 )   MtsZerOutSigCoeffFlag = 0 ...

The meanings of the major variables shown in Table are as follows.

1. cbWidth, cbHeight: the width and height of the current coding block

2. log 2TbWidth, log 2TbHeight: the log value of base-2 for the width and height of the current transform block, it may be reduced, by reflecting the zero-out, to a top-left region in which a non-zero coefficient may exist.

3. sps_lfnst_enabled_flag: a flag indicating whether or not the LFNST is enabled, if the flag value is 0, it indicates that the LFNST is not enabled, and if the flag value is 1, it indicates that the LFNST is enabled. It is defined in the sequence parameter set (SPS).

4. CuPredMode[chType][x0][y0]: a prediction mode corresponding to the variable chType and the (x0, y0) position, chType may have values of 0 and 1, wherein 0 indicates a luma component and 1 indicates a chroma component. The (x0, y0) position indicates a position on the picture, and MODE_INTRA (intra prediction) and MODE_INTER (inter prediction) are possible as a value of CuPredMode[chType][x0][y0].

5. IntraSubPartitionsSplit[x0][y0]: the contents of the (x0, y0) position are the same as in No. 4. It indicates which ISP partition at the (x0, y0) position is applied, ISP_NO_SPLIT indicates that the coding unit corresponding to the (x0, y0) position is not divided into partition blocks.

6. intra mip_flag[x0][y0]: the contents of the (x0, y0) position are the same as in No. 4 above. The intra mip_flag is a flag indicating whether or not a matrix-based intra prediction (MIP) prediction mode is applied. If the flag value is 0, it indicates that MIP is not enabled, and if the flag value is 1, it indicates that MIP is enabled.

7. cIdx: the value of 0 indicates luma, and the values of 1 and 2 indicate Cb and Cr which are respectively chroma components.

8. treeType: indicates single-tree and dual-tree, etc. (SINGLE_TREE: single tree, DUAL_TREE_LUMA: dual tree for luma component, DUAL_TREE_CHROMA: dual tree for chroma component)

9. tu_cbf_cb[x0][y0]: the contents of the (x0, y0) position are the same as in No. 4. It indicates the coded block flag (CBF) for the Cb component. If its value is 0, it means that no non-zero coefficients are present in the corresponding transform unit for the Cb component, and if its value is 1, it indicates that non-zero coefficients are present in the corresponding transform unit for the Cb component.

10. lastSubBlock: It indicates a position in the scan order of a sub-block (Coefficient Group (CG)) in which the last non-zero coefficient is located. 0 indicates a sub-block in which the DC component is included, and in the case of being greater than 0, it is not a sub-block in which the DC component is included.

lastScanPos: It indicates the position where the last significant coefficient is in the scan order within one sub-block. If one sub-block includes 16 positions, values from 0 to 15 are possible.

lfnst_idx[x0][y0]: LFNST index syntax element to be parsed. If it is not parsed, it is inferred as a value of 0. That is, the default value is set to 0, indicating that LFNST is not applied.

cu_sbt_flag: A flag indicating whether a subblock transform (SBT) included in the current VVC standard is applicable. A flag value equal to 0 indicates that the SBT is not applicable, and a flag value equal to 1 indicates that the SBT is applied.

sps_explicit_mts_inter_enabled_flag, sps_explicit_mts_intra_enabled_flag: Flags indicating whether an explicit MTS is applied to an inter CU and an intra CU, respectively. A flag value equal to 0 indicates the MTS is not applicable to the inter CU or the intra CU, and a flag value equal to 1 indicates that the MTS is applicable.

tu_mts_idx[x0][y0]: An MTS index syntax element to be parsed. When not parsed, this element is inferred as a value of 0. That is, the element is set to a default value of 0, which indicates that DCT-2 is applied both horizontally and vertically.

As shown in Table 3, a plurality of conditions is checked when coding mts_idx[x0][y0], and tu_mts_idx[x0][y0] is signaled only when lfnst_idx[x0][y0] is equal to 0.

tu_cbf_luma[x0][y0] is a flag indicating whether a significant coefficient exists for a luma component.

According to Table 3, when both the width and height of a coding unit for the luma component are 32 or less, mts_idx[x0][y0] is signaled (Max(cbWidth, cbHeight)<=32), that is, whether the MTS is applied is determined by the width and height of the coding unit for the luma component.

Further, according to Table 3, it may be configured to signal lfnst_idx[x0][y0] even in the ISP mode (IntraSubPartitionsSplitType!=ISP_NO_SPLIT), and the same LFNST index value may be applied to all ISP partition blocks.

However, mts_idx[x0][y0] may be signaled only in a case other than the ISP mode (IntraSubPartitionsSplit[x0][y0]==ISP_NO_SPLIT).

As shown in Table 5, checking the value of mts_idx[x0][y0] may be omitted in a process of determining log 2ZoTbWidth and log 2ZoTbHeight (where log 2ZoTbWidth and log 2ZoTbHeight respectively denote the base-2 logarithm values of the width and height of a top-left region remaining after zero-out is performed).

According to an example, a condition of checking sps_mts_enable_flag may be added when determining log 2ZoTbWidth and log 2ZoTbHeight in residual coding.

A variable LfnstZeroOutSigCoeffFlag in Table 3 is 0 if there is a significant coefficient at a zero-out position when the LFNST is applied, and is 1 otherwise. The variable LfnstZeroOutSigCoeffFlag may be set according to a plurality of conditions shown in Table 5.

According to an example, a variable LfnstDcOnly in Table 3 is 1 when all last significant coefficients for transform blocks for which a corresponding coded block flag (CBF, which is 1 when there is at least one significant coefficient in a corresponding block, and is 0 otherwise) is 1 are at DC positions (top-left positions), and is 0 otherwise. Specifically, the position of the last significant coefficient is checked with respect to one luma transform block in a dual-tree luma, and the position of the last significant coefficient is checked with respect to both a transform block for Cb and a transform block for Cr in a dual-tree chroma. In a single tree, the position of the last significant coefficient may be checked with respect to transform blocks for luma, Cb, and Cr.

In Table 3, MtsZeroOutSigCoeffFlag is initially set to 1, and this value may be changed in the residual coding of Table 5. The variable MtsZeroOutSigCoeffFlag is changed from 1 to 0 when there is a significant coefficient in a region to be filled with 0s by a zero-out (LastSignificantCoeffX>15∥LastSignificantCoeffY>15), in which case the MTS index is not signaled as shown in Table 3.

As shown in Table 3, when tu_cbf_luma[x0][y0] is 0, coding mts_idx[x0][y0] may be omitted. That is, when the CBF value of the luma component is 0, no transform is applied and thus the MTS index does not need signaling. Therefore, coding the MTS index may be omitted.

According to an example, the above technical feature may be implemented in another conditional syntax. For example, after the MTS is performed, a variable indicating whether a significant coefficient exists in a region other than the DC region of the current block may be derived, and when the variable indicates that the significant coefficient exists in the region excluding the DC region, the MTS index can be signaled. That is, the existence of the significant coefficient in the region other than the DC region of the current block indicates that the value of tu_cbf_luma[x0][y0] is 1, and in this case, the MTS index can be signaled.

The variable may be expressed as MtsDcOnly, and after the variable MtsDcOnly is initially set to 1 at the coding unit level, the value is changed to 0 when it is determined that the significant coefficient is present in the region except for the DC region of the current block in the residual coding level. When the variable MtsDcOnly is 0, image information may be configured such that the MTS index is signaled.

When tu_cbf_luma[x0][y0] is 0, since the residual coding syntax is not called at the transform unit level of Table 5, the initial value of 1 of the variable MtsDcOnly is maintained. In this case, since the variable MtsDcOnly is not changed to 0, the image information may be configured so that the MTS index is not signaled. That is, the MTS index is not parsed and signaled.

Meanwhile, the decoding apparatus may determine the color index cIdx of the transform coefficient to derive the variable MtsZeroOutSigCoeffFlag of Table 5. The color index cIdx of 0 means a luma component.

According to an example, since the MTS can be applied only to the luma component of the current block, the decoding apparatus can determine whether the color index is luma when deriving the variable MtsZeroOutSigCoeffFlag for determining whether to parse the MTS index.

The variable MtsZeroOutSigCoeffFlag is a variable indicating whether the zero-out is performed when the MTS is applied. It indicates whether the transform coefficient exists in the top-left region where the last significant coefficient may exist due to the zero-out after the MTS is performed, that is, in the region other than the top-left 16×16 region. The variable MtsZeroOutSigCoeffFlag is initially set to 1 at the coding unit level as shown in Table 3 (MtsZeroOutSigCoeffFlag=1), and when the transform coefficient exists in the region other than the 16×16 region, its value can be changed from 1 to 0 in the residual coding level as shown in Table 5 (MtsZeroOutSigCoeffFlag=0). When the value of the variable MtsZeroOutSigCoeffFlag is 0, the MTS index is not signaled.

As shown in Table 5, at the residual coding level, a non-zero-out region in which a non-zero transform coefficient may exist may be set depending on whether or not the zero-out accompanying the MTS is performed, and even in this case, the color index (cIdx) is 0, the non-zero-out region may be set to the top-left 16×16 region of the current block.

As such, when deriving the variable that determines whether the MTS index is parsed, it is determined whether the color component is luma or chroma. However, since LFNST can be applied to both the luma component and the chroma component of the current block, the color component is not determined when deriving a variable for determining whether to parse the LFNST index.

For example, Table 3 shows a variable LfnstZeroOutSigCoeffFlag that may indicate that zero-out is performed when LFNST is applied. The variable LfnstZeroOutSigCoeffFlag indicates whether a significant coefficient exists in the second region except for the first region at the top-left of the current block. This value is initially set to 1, and when the significant coefficient is present in the second region, the value can be changed to 0. The LFNST index can be parsed only when the value of the initially set variable LfnstZeroOutSigCoeffFlag is maintained at 1. When determining and deriving whether the variable LfnstZeroOutSigCoeffFlag value is 1, since the LFNST may be applied to both the luma component and the chroma component of the current block, the color index of the current block is not determined.

As shown in Table 3, the MTS index is signaled for each coding unit, and mts_idx (MTS index) is signaled only when MtsZeroOutSigCoeffFlag is equal to 1.

Further, as shown in Table 5, the value of MtsZeroOutCoeffFlag may be determined according to a specific condition (if((LastSignificantCoeffX>15∥LastSignificantCoeffY>15) && cIdx==0)) in a residual coding level.

The value of MtsZeroOutSigCoeffFlag is set to 0 when the x-coordinate (LastSignificantCoeffX) of the last non-zero coefficient is greater than 15 and the y-coordinate (LastSignificantCoeffY) of the last non-zero coefficient is greater than 15. Here, x-coordinates increase from left to right in the transform block, and y-coordinates increase from top to bottom in the transform block. The top-left position of the transform block is (0, 0).

The value of MtsZeroOutSigCoeffFlag is initialized to 1 in Table 3, and is maintained as 1 if the condition present in Table 5 is not satisfied and thus the value of MtsZeroOutSigCoeffFlag is not set to 0.

When a primary transform applied in a horizontal direction is A and a primary transform applied in a vertical direction is B, a primary transform may be represented by (A, B). In the current VVC standard, in a case of (DST-7, DST-7), (DST-7, DCT-8), (DCT-8, DST-7), and (DCT-8, DCT-8), a transform coefficient is limited to exist only in a top-left 16×16 region of the transform block. Therefore, the condition of (LastSignificantCoeffX>15∥LastSignificantCoeffY>15) in Table 6 indicates that the last non-zero coefficient is positioned outside the top-left 16×16 region. In Table 5, a variable cIdx denotes a color component, and a variable cIdx value of 0 indicates a luma component.

In the current VVC standard, the MTS index (mts_idx) is parsed after parsing for residual coding. Specifically, Table 3 is a coding unit that is a syntax parsing function for a coding unit, the MTS index is parsed after a transform tree function, and a function of parsing residual coding in the transform tree function is invoked. Therefore, the MTS index is parsed after residual parsing (a residual parsing function illustrated in Table 5 is responsible for parsing the residual coding), and since MTS index information is not known from the perspective of decoding during residual coding, it may not be impossible to know which primary transform is applied. However, when the MTS is applicable and the SBT or ISP is applied or when the implicit MTS is applied, the MTS is implicitly applied, and thus it is possible to know about the primary transform before parsing for residual coding.

The condition illustrated in Table 5 needs checking, because the current VVC standard sets a restriction of outputting only 16 transform coefficients when a forward transform is applied in 32-length DST-7 or 32-length DCT-8. For example, when the value of the MTS index is greater than 0 and thus indicates that an applied primary transform is one of (DST-7, DST-7), (DST-7, DCT-8), (DCT-8, DST-7), (DCT-8, DCT-8), a non-zero transform coefficient may exist only in the top-left 16×16 region of the transform block.

Accordingly, when the position of the last non-zero transform coefficient is outside the top-left 16×16 region, which corresponds to a case where the MTS index value is 0, signaling of the MTS index may be omitted as shown in Table 3. However, even though the position of the last non-zero transform coefficient is within the top-left 16×16 region, a non-zero coefficient may exist outside the top-left 16×16 region. In this case, the MTS index may be signaled as 0 even though the MTS index value is 0, which is described in detail as follows.

When the primary transform is (DCT-2, DCT-2), the position of the last non-zero coefficient exists in the top-left 16×16 region and a non-zero transform coefficient may also exist outside the top-left 16×16 region, because in the scan order within the transform block, a region outside the top-left 16×16 region, that is, a region other than the top-left 16×16 region, may be scanned and then the top-left 16×16 region may be scanned, or the top-left 16×16 region may be scanned and then the region outside the top-left 16×16 region may be scanned.

FIG. 12 illustrates a scan of a 32×32 transform block according to an embodiment of the present disclosure, which specifically shows that the 32×32 transform block is divided into 4×4 coefficient groups (CGs) and scanned. In the present disclosure, the CGs divided to be scanned are referred to as “scan subblocks”.

A number indicated for each CG denotes a forward scan order, and the CGs may be scanned by the decoding apparatus according to a reverse scan order from the position where the last non-zero transform coefficient exists. In FIG. 12 , it may be assumed that the last non-zero transform coefficient exists in CG 25, and CG 25 exists in the top-left 16×16 region.

As shown in FIG. 12 , when the last non-zero transform coefficient exists in CG 25, since the decoding apparatus scans the CGs according to the reverse scan order from the CG in which the last non-zero transform coefficient exists, the decoding apparatus scans the CGs in an order of 25, 24, 23, . . . , 3, 2, 1 based on the numbers indicated in FIG. 12 . Since CGs 24, 23, 22, 21, 20, 17, 16, 15, and 11 are positioned outside the top-left 16×16 region, it is impossible to know whether a non-zero coefficient exists only in the top-left 16×16 region only by checking whether LastSignificantCoeffX and LastSignificantCoeffY correspond to the top-left 16×16 region as shown in Table 5.

Therefore, when performing parsing for residual coding, if checking whether a corresponding 4×4 coefficient group belongs to the top-left 16×16 region whenever a non-zero transform coefficient is scanned, the value of MtsZeroOutSigCoeffFlag may be set to 0 only in a case where a non-zero coefficient exists outside the top-left 16×16 region. In this case, a residual coding syntax is as shown in the following table.

TABLE 6 residual_coding( x0, y0, log2TbWidth, log2TbHeight, cIdx) { Descriptor  if( ( ( sps_mts_enabled_flag && cu_sbt_flag &&     log2Tb Width < 6 && log2TbHeight < 6 ) )     && cIdx = = 0 && log2TbWidth > 4 )   log2ZoTbWidth = 4  else   log2ZoTbWidth = Min( log2TbWidth, 5 )  if( ( sps_mts_enabled flag && cu_sbt_flag &&     log2TbWidth < 6 && log2TbHeight < 6 ) )     && cIdx = = 0 && log2TbHeight > 4 )   log2ZoTbHeight = 4  else   log2ZoTbHeight = Min( log2TbHeight, 5 )  if( log2Tb Width > 0 )   last_sig_coeff_x_prefix ae(v)  if( log2TbHeight > 0 )   last_sig_coeff_y_prefix ae(v)  if( last_sig_coeff_x_prefix > 3 )   last sig_coeff_x_suffix ae(v)  if( last_sig_coeff_y_prefix > 3 )   last_sig_coeff_y_suffix ae(v)  log2Tb Width = log2ZoTbWidth  log2TbHeight = log2ZoTbHeight  remBinsPass1 = ( ( 1 << ( log2TbWidth + log2TbHeight ) ) * 7 ) >> 2  log2SbW = (Min( log2Tb Width, log2TbHeight) < 2 ? 1 : 2 )  log2SbH = log2SbW  if( log2TbWidth + log2TbHeight > 3 ) {   if( log2Tb Width < 2 ) {    log2SbW = log2TbWidth    log2SbH = 4 − log2SbW   } else if( log2TbHeight < 2 ) {    log2SbH = log2TbHeight    log2SbW = 4 − log2SbH   }  }

 numSbCoeff = 1 << (log2SbW + log2SbH)  lastScanPos = numSbCoeff  lastSubBlock = ( 1 << (log2Tb Width + log2TbHeight - (log2SbW + log2SbH ) ) ) − 1  do {   if( lastScanPos = = 0 ) {    lastScanPos = numSbCoeff    lastSubBlock− −   }   lastScanPos− −   xS = DiagScanOrder[ log2Tb Width − log2SbW ][ log2TbHeight −log2SbH ]         [ lastSubBlock ] [ 0 ]   yS = DiagScanOrder[ log2Tb Width − log2SbW ][ log2TbHeight − log2SbH ]         [ lastSubBlock ] [ l ]   xC = ( xS << log2SbW ) + DiagScanOrder[ log2SbW ][ log2SbH ][ lastScanPos ][ 0 ]   yC = ( yS << log2SbH ) + DiagScanOrder[ log2SbW ][ log2SbH ][ lastScanPos ][ l ]  }while((xC != LastSignificantCoeffX) | | (yC != LastSignificantCoeffY ) )  if( lastSubBlock = = 0 && log2TbWidth >= 2 && log2TbHeight >= 2 &&   !transform_skip_flag[ x0 ][ y0 ][ cIdx ] && lastScanPos > 0 )   LfnstDcOnly = 0  if( (lastSubBlock > 0 && log2TbWidth >= 2 && log2TbHeight >= 2 ) | |   ( lastScanPos > 7 && ( log2Tb Width = = 2 | | log2TbWidth = = 3 ) &&   log2Tb Width = = log2TbHeight ) )   LfnstZeroOutSigCoeffFlag = 0  if( ( LastSignificantCoeffX > 15 | | LastSignificantCoeffY > 15 ) && cIdx = = 0 )   MtsZeroOutSigCoeffFlag = 0  QState = 0  for( i = lastSubBlock; i  >=  0; i− −) {   startQ State Sb = QState   xS = DiagScanOrder[ log2TbWidth − log2SbW ][ log2TbHeight − log2SbH ]         [ i ][ 0 ]   yS = DiagScanOrder log2TbWidth − log2SbW ][ log2TbHeight − log2SbH ]         [ i ][ 1 ]   inferSbDcSigCoeffFlag = 0   if( (i < lastSubBlock) && ( i > 0 ) ) {    coded_sub_block_flag[ xS ][ yS ] ae(v)    inferSbDcSigCoeffFlag = 1   }

  firstSigScanPosSb = numSbCoeff   lastSigScanPosSb = −1   firstPosMode0 = (i = = lastSubBlock  ? lastScanPos : numSbCoeff - 1)   firstPosMode1 = −1   for( n = firstPosMode0; n >= 0 && remBinsPassl >= 4; n− − ) {    xC = (xS << log2SbW) + DiagScanOrder[ log2SbW ][ log2SbH ][ n ][ 0 ]    yC = (yS << log2SbH ) + DiagScanOrder[ log2SbW ][ log2SbH ][ n ][ l ]    if( coded_sub_block_flag[ xS ][yS ] && (n > 0 | | !inferSbDcSigCoeffFlag) &&     ( xC != LastSignificantCoeffX | | yC != Last SignificantCoeffY ) ) {     sig_coeff_flag[ xC ] [ yC ] ae(v)     remBinsPass1− −     if( sig coeff flag[ xC ] [ yC ] )      inferSbDcSigCoeffFlag = 0    }    if( sig_coeff_flag[ xC ] [ yC ]) {         if( ( xC > 15 | | yC > 15 ) && cIdx  = = 0 )           MtsZeroOutSigCoeffFlag = 0     abs_level_gtx_flag n ] [ 0 ] ae(v)     remBinsPass1− −     if( abs level gtx flag[ n ] [ 0 ]) {      par level flag[ n ] ae(v)      remBinsPass1− −      abs_level_gtx_flag n ] [ l ] ae(v)      remBinsPass1− −      }     if( lastSigScanPosSb  = =  −1)      lastSigScanPosSb = n     firstSigScanPosSb = n    }    AbsLevelPass1[ xC ] [ yC ] = sig_coeff_flag[ xC ][ yC ] + par_level_flag[ n ] +            abs_level_gtxflag[ n ] [ 0 ] + 2 * abs_level_gtx_flag [ n ] [ 1 ]    if( pic_dep_quant_enabled_flag )     QState = QStateTransTable[ QState ][ AbsLevelPass1[ xC ][ yC ] & 1 ]    if( remBinsPass1 < 4 )     firstPosMode1 = n − 1   }   ... ...  } }

As shown in Table 6, whenever anon-zero transform coefficient is found, whether the non-zero transform coefficient is positioned in the top-left 16×16 region (if((xC>15∥yC>15) && cIdx==0)) may be checked, thereby setting the value MtsZeroOutSigCoeffFlag to 0. Here, this condition is checked when the value of sig_coeff_flag[xC][yC], which is flag information indicating whether the transform coefficient exists, is 1 (if(sig_coeff_flag[xC][yC])), where xC and yC respectively denote an x-coordinate and a y-coordinate in sample units within the transform block. The top-left position of the transform block is (0, 0).

Table 6 includes the condition check presented in Table 5 and an update of MtsZeroOutSigCoeffFlag (if((LastSignificantCoeffX>15∥LastSignificantCoeffY>15) && cIdx==0)MtsZeroOutSigCoeffFlag=0). If the value of sig_coeff_flag[xC][yC] for the last non-zero transform coefficient is inferred to be 1, the condition check and the update of MtsZeroOutSigCoeffFlag may be removed from Table 6.

In summary, when signaling the MTS index in Table 3 through the syntax configuration shown in Table 6, the MTS index is signaled only when a non-zero transform coefficient exists in a top-left 16×16 region of a luma transform block regardless of which primary transform is applied. When the MTS index is not signaled, the value of the MTS index is inferred as 0, that is, (DCT-2, DCT-2) is applied.

As described above, in the following three cases, an applied primary transform can be known before the MTS index is signaled.

1) Where the subblock transform (SBT) is applied

2) Where the intra sub-partition (ISP) is applied

3) Where the implicit MTS is applied

In case (1), since the MTS index is configured to be signaled only when the value of cu_sbt_flag indicating whether the SBT is applied in Table 3 is 0, that is, since the MTS index is signaled only when the SBT is not applied, the case where the SBT is applied is irrelevant to the modification of Table 6.

In case (2), since the MTS index is signaled only when the ISP is not applied in Table 3 (a condition if IntraSubPartitionsSplit[x0][y0]==ISP_NO_SPLIT is checked when signaling the MTS index in Table 3), the case where the ISP is applied is also irrelevant to the modification of Table 6.

In case (3), since the MTS index is signaled only when an explicit MTS is enabled in Table 3, the case where the implicit MTS is applied is also irrelevant to the modification of Table 6. That is, since the MTS index is signaled only when the value of sps_explicit_mts_intra_enabled_flag is 1 in an MTS (intra MTS) applied to a residual block generated by intra prediction and the value of sps_explicit_mts_inter_enabled_flag is 1 in an MTS (inter MTS) applied to a residual block generated by inter prediction, the modification of Table 7 does not affect the case where the implicit MTS is applied.

According to another example, as shown in the following table, it may be checked whether a non-zero coefficient exists outside the top-left 16×16 region by a unit of a CG.

TABLE 7 residual_coding( x0, y0, log2TbWidth, log2TbHeight, cIdx ) { Descriptor  if( ( ( sps_mts_enabled_flag && cu_sbt_flag &&     log2TbWidth < 6 && log2TbHeight < 6 ) )    && cIdx = = 0 && log2TbWidth > 4 )   log2ZoTbWidth = 4  else   log2ZoTbWidth = Min( log2TbWidth, 5 )  if( (sps mts enabled flag && cu sbt flag &&     log2Tb Width < 6 && log2TbHeight < 6 ) )    && cIdx = = 0 && log2TbHeight > 4 )   log2ZoTbHeight = 4  else   log2ZoTbHeight = Min( log2TbHeight, 5 )  if( log2Tb Width > 0 )   last_sig_coeff_x_prefix ae(v)  if( log2TbHeight > 0 )   last_sig_coeff_y_prefix ae(v)  if( last_sig_coeff_x_prefix > 3 )   last_sig_coeff_x_suffix ae(v)  if( last_sig_coeff_y_prefix > 3 )   last_sig_coeff_y suffix ae(v)  log2Tb Width = log2ZoTbWidth  log2TbHeight = log2ZoTbHeight  remBinsPass1 = ( ( 1 << ( log2TbWidth + log2TbHeight ) ) * 7 ) >> 2  log2SbW = ( Min( log2TbWidth, log2TbHeight) < 2 ? 1 : 2 )  log2SbH = log2SbW  if( log2Tb Width + log2TbHeight > 3 ) {   if( log2Tb Width < 2 ) {    log2SbW = log2Tb Width    log2SbH = 4 − log2SbW   } else if( log2TbHeight < 2 ) {    log2SbH = log2TbHeight    log2SbW = 4 − log2SbH   }  }

 numSbCoeff = 1 << ( log2SbW + log2SbH )  lastScanPos = numSbCoeff  lastSubBlock = ( 1 << ( log2Tb Width + log2TbHeight − ( log2SbW + log2SbH ) ) ) − 1  do {   if( lastScanPos  = =  0 ) {    lastScanPos = numSbCoeff    lastSubBlock− −   }   lastScanPos− −   xS = DiagScanOrder[ log2Tb Width − log2SbW ][ log2TbHeight − log2SbH ]         [ lastSubBlock ][ 0 ]   yS = DiagScanOrder[ log2Tb Width − log2SbW ][ log2TbHeight − log2SbH ]         [ lastSubBlock ][ l ]   xC = ( xS << log2SbW) + DiagScanOrder[ log2SbW ][ log2SbH ][ lastScanPos ][ 0 ]   yC = ( yS << log2SbH ) + DiagScanOrder[ log2SbW ][ log2SbH ][ lastScanPos ][ l ]  }while( ( xC != LastSignificantCoeffX) | | ( yC != LastSignificantCoeffY ) )  if( lastSubBlock = = 0 && log2TbWidth >= 2 && log2TbHeight >= 2 &&   !transform_skip_flag[ x0 ][ y0 ][ cIdx ] && lastScanPos > 0 )   LfnstDcOnly = 0  if( ( lastSubBlock > 0 && log2TbWidth >= 2 && log2TbHeight >= 2 ) | |   ( lastScanPos > 7 && ( log2Tb Width = = 2 | | log2TbWidth = = 3 ) &&   log2TbWidth = = log2TbHeight ) )   LfnstZeroOutSigCoeffFlag = 0  if( ( LastSignificantCoeffX > 15 | | LastSignificantCoeffY > 15 ) && cIdx = = 0 )   MtsZeroOutSigCoeffFlag = 0  QState = 0  for( i = lastSubBlock; i >= 0; i− − ) {   startQ State Sb = Q State   xS = DiagScanOrder[ log2Tb Width − log2SbW ][ log2TbHeight − log2SbH ]         [ i ][ 0 ]   yS = DiagScanOrder[ log2Tb Width − log2SbW ][ log2TbHeight − log2SbH ]         [ i ][ 1 ]   inferSbDcSigCoeffFlag = 0   if( (i < lastSubBlock ) && ( i > 0 ) ) {    coded_sub_block_flag[ xS ][ yS ] ae(v)    inferSbDcSigCoeffFlag = 1   }     if( coded_sub_block_flag[ xS ][ yS ] && ( ( xS << log2SbW) > 15 | | ( yS << log2SbH ) > 15 ) && cIdx = = 0)       MtsZeroOutSigCoeffFlag = 0

  firstSigScanPosSb = numSbCoeff   lastSigScanPosSb = −1   firstPosMode0 = (i = = lastSubBlock ? lastScanPos : numSbCoeff − 1)   firstPosMode1 = −1   for( n = firstPosMode0; n >= 0 && remBinsPass1 >= 4; n− −) {    xC = (xS << log2SbW) + DiagScanOrder log2SbW ][ log2SbH ][ n ][ 0 ]    yC = (yS << log2SbH ) + DiagScanOrder log2SbW ][ log2SbH ][ n ][ 1 ]    if( coded_sub_block_flag[ xS ][ yS ] && (n > 0  | |   !inferSbDcSigCoeffFlag) &&     ( xC != LastSignificantCoeffX | | yC != Last SignificantCoeffY ) ) {     sig_coeff_flag[ xC ][ yC ] ae(v)     remBinsPass1− −     if( sig_coeff_flag[ xC ][ yC ] )      inferSbDcSigCoeffFlag = 0    }    if( sig_coeff_flag[ xC ][ yC ] ) {     abs_level_gtx_flag[ n ][ 0 ] ae(v)     remBinsPass1− −     if( abs_level_gtx_flag[ n ][ 0 ] ) {      par_level_flag[ n ] ae(v)      remBinsPass1− −      abs_level_gtx_flag[ n ][ 1 ] ae(v)      remBinsPass1− −     }     if( lastSigScanPosSb  = =  −1)      lastSigScanPosSb = n     firstSigScanPosSb = n    }    AbsLevelPass1[ xC ][ yC ] = sig_coeff_flag[ xC ][ yC ] + par_level_flag[ n ] +            abs_level_gtx_flag[ n ] [ 0 ] + 2 * abs_level_gtx_flag[ n ][ 1 ]    if( pic_dep_quant_enabled_flag )     QState = QStateTransTable[ QState ][ AbsLevelPass1[ xC ][ yC ] & 1 ]    if( remBinsPass1 < 4 )     firstPosMode1 = n − 1   }   ... ...  } }

In Table 7, xS and yS denote an x-coordinate position and a y-coordinate position in each CG unit inside the current transform block, and need to be converted into coordinates in sample units to check whether the transformation coefficient is positioned outside the top-left 16×16 region. That is, xS and yS are converted to coordinates in sample units as in (xS<<log 2SbW) and (yS<<log 2SbH). Here, log 2SbW and log 2SbH respectively denote the base-2 logarithm values of the width and height of a corresponding CG, x-coordinates increase from left to right in the transform block, and y-coordinates increase from top to bottom. The coordinates of the top-left position of the transform block is (0, 0).

As shown in Table 7, in scanning by a unit of a CG, when a non-zero transform coefficient exists inside each CG (when the value of coded_sub_block_flag[xS][yS] is 1) and the CG is identified to be positioned outside the top-left 16×16 region of the transform block ((xS<<log 2SbW)>15∥(yS<<log 2SbH)>15)), the value of MtsZeroOutSigCoeffFlag is set to 0.

As shown in Table 3, since the value of the variable MtsZeroOutSigCoeffFlag is initialized to 1, the value of MtsZeroOutSigCoeffFlag is maintained at 1 unless the value of MtsZeroOutSigCoeffFlag is set to 0. When the value of coded_sub_block_flag[xS][yS] for a CG to which the last non-zero transform coefficient belongs is inferred to be 1, the condition check part in Table 5 and the update of MtsZeroOutSigCoeffFlag (if((LastSignificantCoeffX>15∥LastSignificantCoeffY)>15) && cIdx==0) MtsZeroOutSigCoeffFlag=0) may be removed from Table 7.

The following drawings are provided to describe specific examples of the present disclosure. Since specific terms for devices or specific terms for signals/messages/fields illustrated in the drawings are provided for illustration, technical features of the present disclosure are not limited to the specific terms used in the following drawings.

FIG. 13 is a flowchart illustrating an operation of a video decoding apparatus according to an embodiment of the present disclosure.

Each process disclosed in FIG. 13 is based on some of details described with reference to FIG. 1 to FIG. 12 . Therefore, a description of specific details overlapping those described with reference to FIG. 1 to FIG. 12 will be omitted or will be schematically made.

The decoding apparatus 200 according to an embodiment may receive a bitstream including residual information and may derive residual information, for example, quantized transform coefficients, for a current block, that is, a transform block to be transformed, from the bitstream (S1310).

Specifically, the decoding apparatus 200 may decode information on quantized transform coefficients for a current block from the bitstream and may derive quantized transform coefficients for a target block based on the information on the quantized transform coefficients for the current block. Information on the quantized transform coefficients for the target block may be included in a sequence parameter set (SPS) or a slice header and may include at least one of information on whether an RST is applied, information on a reduced factor, information on a minimum transform size for applying an RST, information on a maximum transform size for applying an RST, an inverse RST size, and information on a transform index indicating any one of transform kernel matrices included in a transform set.

The decoding apparatus 200 may derive the position of a last significant coefficient in the current block and transform coefficients for the current block based on the residual information (S1320). The decoding apparatus 200 may derive the transform coefficients by dequantizing the quantized transform coefficients the current block.

The derived transform coefficients may be two-dimensionally arranged in the current block, and the decoding apparatus may derive information on non-zero data, that is, a non-zero significant coefficient, in the current block through this residual coding. That is, the decoding apparatus may identify last position information on the non-zero significant coefficient in the current block.

The transform coefficients derived based on the residual information in S1320 may be the dequantized transform coefficients as described above or may be the quantized transform coefficients. That is, the transform coefficients only need to be data for identifying the non-zero data in the current block and the position of the significant coefficient regardless of quantization.

The decoding apparatus may derive modified transform coefficients by applying an LFNST to the transform coefficients or may not perform the LFNST.

The decoding apparatus may derive residual samples by performing inverse primary transform of the transform coefficients or the modified transform coefficients. The decoding apparatus may use general DCT-2 as a transform kernel or may apply the foregoing MTS for the inverse primary transform.

The MTS may be implicitly performed or may be performed based on explicit signaling of an MTS index.

The decoding apparatus may check predetermined conditions to parse the MTS index.

According to an example, the decoding apparatus may determine whether the significant coefficient existing in a scan subblock exists in a second region other than a top-left first region of the current block. (S1330).

For this, the decoding apparatus may derive flag information indicating whether significant coefficients exist in the second region other than the top-left first region of the current block. In this case, the flag information may be derived by determining whether the significant coefficient exists in the second region by a unit of the scan subblock in which the significant coefficient is scanned.

According to an example, when the MTS is applied for the inverse primary transform, the decoding apparatus may perform the inverse primary transform on transform coefficients in the top-left first region of the current block to be transformed. That is, the second region other than the top-left first region of the current block is zeroed out and thus includes no transform coefficient.

According to an example, when the MTS is applied, the first region may be atop-left 16×16 region of the current block, in which case the second region may be a region other than the top-left 16×16 region.

The scan subblock may be a 4×4 block and may be scanned according to a reverse diagonal scan direction from the position of the last significant coefficient in the current block as shown in FIG. 12 .

To parse the MTS index after determining whether a significant coefficient exists in the zero-out region, the decoding apparatus may derive flag information indicating whether a significant coefficient exists in the second region and may parse the MTS index based on the flag information.

The flag information may be a variable MtsZeroOutSigCoeffFlag, and whether a significant coefficient exists in the second region may be determined by the unit of the scan subblock of scanning the significant coefficient.

When a flag indicating whether a significant coefficient exists in a scan subblock (coded_sub_block_flag or sb_coded_flag) illustrated in Table 7 is equal to a value of 1 and a significant coefficient existing in the scan subblock is positioned in the second region (((xS<<log 2SbW)>15∥(yS<<log 2SbH)>15)), the variable MtsZeroOutSigCoeffFlag may indicate that the significant coefficient exists in the second region.

Alternatively, the variable MtsZeroOutSigCoeffFlag may be derived by checking whether the 4×4 scan subblock belongs to the first region whenever scanning the transform coefficients as in Table 6. That is, when a flag indicating whether a significant coefficient exists in a scan subblock (sig_coeff_flag) is equal to a value of 1 and a significant coefficient existing in the scan subblock is positioned in the second region (if((xC>15∥yC>15)), the variable MtsZeroOutSigCoeffFlag may indicate that the significant coefficient exists in the second region.

Alternatively, when a flag indicating whether a significant coefficient exists in a scan subblock is equal to a value of 1 and the scan subblock is positioned in the second region, the variable MtsZeroOutSigCoeffFlag may indicate that a significant coefficient exists in the second region.

The variable MtsZeroOutSigCoeffFlag may be initially set to 1, may be maintained as 1 when the significant coefficient is not positioned in the second region, and may be changed to 0 when the significant coefficient is positioned in the second region.

The decoding apparatus may parse the MTS index from the bitstream based on the significant coefficient not being present in the second region (S1340).

That is, when the value of the variable MtsZeroOutSigCoeffFlag, initially set to 1, is maintained, the MTS index may be parsed.

The decoding apparatus may derive residual samples for the current block by applying a transform kernel derived based on the MTS index to transform coefficients in the first region (S1350).

Subsequently, the decoding apparatus 200 may generate reconstructed samples based on the residual samples for the current block and predication samples for the current block.

The following drawings are provided to describe specific examples of the present disclosure. Since specific terms for devices or specific terms for signals/messages/fields illustrated in the drawings are provided for illustration, technical features of the present disclosure are not limited to the specific terms used in the following drawings.

The following drawings are provided to describe specific examples of the present disclosure. Since specific terms for devices or specific terms for signals/messages/fields illustrated in the drawings are provided for illustration, technical features of the present disclosure are not limited to the specific terms used in the following drawings.

FIG. 14 is a flowchart illustrating an operation of a video encoding apparatus according to an embodiment of the present disclosure.

Each process disclosed in FIG. 14 is based on some of details described with reference to FIG. 1 to FIG. 12 . Therefore, a description of specific details overlapping those described with reference to FIG. 1 to FIG. 12 will be omitted or will be schematically made.

The encoding apparatus 200 according to an embodiment may derive prediction samples based on an intra prediction mode applied to a current block (S1410).

The encoding apparatus 200 according to an embodiment may derive residual samples for the current block based on the prediction samples (S1420).

The encoding apparatus 200 according to an embodiment may derive transform coefficients for the target block based on primary transform for the residual samples (S1430).

According to an example, the encoding apparatus may use general DCT-2 as a transform kernel or may apply the foregoing MTS for the primary transform.

The MTS may be implicitly performed or may be performed based on explicit signaling of an MTS index.

The encoding apparatus may determine whether to perform the MTS for the primary transform, and may derive the transform coefficients by applying DCT-8 or DST-7 to the residual samples when the MTS is determined to be performed.

According to an example, when the MTS is applied for the primary transform, the encoding apparatus may zero out a second region other than a top-left first region of the current block (S1440).

According to an example, the first region may be a top-left 16×16 region of the current block, in which case the second region may be a region other than the top-left 16×16 region.

Due to this zero-out, it is possible to reduce the amount of computation required to perform the entire transform process and to reduce the amount of operation required for the entire transform process, thus reducing power consumption required to perform the transform. Further, latency entailed in the transform process may be reduced, thus increasing image coding efficiency.

The encoding apparatus may construct image information so that the MTS index is parsed based on the significant coefficient not existing in the second region, in this case, whether the significant coefficient exists in the second region is determined by a unit of the scan subblock in which the significant coefficient is scanned (S1450).

In addition, the encoding apparatus may configure the image information to derive flag information indicating whether the significant coefficient exists in the second region in order to determine whether the MTS index is parsed.

That is, the encoding apparatus may construct the image information so that the image information illustrated in Table 6 or Table 7 may be parsed in a decoding apparatus.

According to an example, the scan subblock may be a 4×4 block and may be scanned according to a reverse diagonal scan direction from the position of the last significant coefficient in the current block also in the decoding apparatus as shown in FIG. 12 .

The flag information may be a variable MtsZeroOutSigCoeffFlag, and whether a significant coefficient exists in the second region may be determined by the unit of the scan subblock of scanning the significant coefficient.

When a flag indicating whether a significant coefficient exists in a scan subblock (coded_sub_block_flag) illustrated in Table 7 is equal to a value of 1 and a significant coefficient existing in the scan subblock is positioned in the second region (((xS<<log 2SbW)>15∥(yS<<log 2SbH)>15)), the variable MtsZeroOutSigCoeffFlag may indicate that the significant coefficient exists in the second region.

Alternatively, the variable MtsZeroOutSigCoeffFlag may be derived by checking whether the 4×4 scan subblock belongs to the first region whenever scanning the transform coefficients as in Table 6. That is, when a flag indicating whether a significant coefficient exists in a scan subblock (sig_coeff_flag) is equal to a value of 1 and a significant coefficient existing in the scan subblock is positioned in the second region (if((xC>15∥yC>15)), the variable MtsZeroOutSigCoeffFlag may indicate that the significant coefficient exists in the second region.

Alternatively, when a flag indicating whether a significant coefficient exists in a scan subblock is equal to a value of 1 and the scan subblock is positioned in the second region, the variable MtsZeroOutSigCoeffFlag may indicate that a significant coefficient exists in the second region.

The variable MtsZeroOutSigCoeffFlag may be initially set to 1, may be maintained as 1 when the significant coefficient is not positioned in the second region, and may be changed to 0 when the significant coefficient is positioned in the second region.

The encoding apparatus may derive modified transform coefficients by further applying an LFNST to the transform coefficients derived after the primary transform.

The encoding apparatus may encode residual information, derived based on the transform coefficients or the modified transform coefficients for the current block, and the MTS index based on the significant coefficient not being present in the second region (S1460).

That is, the encoding apparatus may generate the residual information including information on quantized transform coefficients. The residual information may include an information/syntax element related to the foregoing transform. The encoding apparatus may encode image/video information including the residual information and may output the encoded image/video information in the form of a bitstream.

Specifically, the encoding apparatus 100 may generate the information pm the quantized transform coefficients and may encode the generated information on the quantized transform coefficients.

In the present disclosure, at least one of quantization/dequantization and/or transform/inverse transform may be omitted. When quantization/dequantization is omitted, a quantized transform coefficient may be referred to as a transform coefficient. When transform/inverse transform is omitted, the transform coefficient may be referred to as a coefficient or a residual coefficient, or may still be referred to as a transform coefficient for consistency of expression.

In addition, in the present disclosure, a quantized transform coefficient and a transform coefficient may be referred to as a transform coefficient and a scaled transform coefficient, respectively. In this case, residual information may include information on a transform coefficient(s), and the information on the transform coefficient(s) may be signaled through a residual coding syntax. Transform coefficients may be derived based on the residual information (or information on the transform coefficient(s)), and scaled transform coefficients may be derived through inverse transform (scaling) of the transform coefficients. Residual samples may be derived based on the inverse transform (transform) of the scaled transform coefficients. These details may also be applied/expressed in other parts of the present disclosure.

In the above-described embodiments, the methods are explained on the basis of flowcharts by means of a series of steps or blocks, but the present disclosure is not limited to the order of steps, and a certain step may be performed in order or step different from that described above, or concurrently with another step. Further, it may be understood by a person having ordinary skill in the art that the steps shown in a flowchart are not exclusive, and that another step may be incorporated or one or more steps of the flowchart may be removed without affecting the scope of the present disclosure.

The above-described methods according to the present disclosure may be implemented as a software form, and an encoding apparatus and/or decoding apparatus according to the disclosure may be included in a device for image processing, such as, a TV, a computer, a smartphone, a set-top box, a display device or the like.

When embodiments in the present disclosure are embodied by software, the above-described methods may be embodied as modules (processes, functions or the like) to perform the above-described functions. The modules may be stored in a memory and may be executed by a processor. The memory may be inside or outside the processor and may be connected to the processor in various well-known manners. The processor may include an application-specific integrated circuit (ASIC), other chipset, logic circuit, and/or a data processing device. The memory may include a read-only memory (ROM), a random access memory (RAM), a flash memory, a memory card, a storage medium, and/or other storage device. That is, embodiments described in the present disclosure may be embodied and performed on a processor, a microprocessor, a controller or a chip. For example, function units shown in each drawing may be embodied and performed on a computer, a processor, a microprocessor, a controller or a chip.

Further, the decoding apparatus and the encoding apparatus to which the present disclosure is applied, may be included in a multimedia broadcasting transceiver, a mobile communication terminal, a home cinema video device, a digital cinema video device, a surveillance camera, a video chat device, a real time communication device such as video communication, a mobile streaming device, a storage medium, a camcorder, a video on demand (VoD) service providing device, an over the top (OTT) video device, an Internet streaming service providing device, a three-dimensional (3D) video device, a video telephony video device, and a medical video device, and may be used to process a video signal or a data signal. For example, the over the top (OTT) video device may include a game console, a Blu-ray player, an Internet access TV, a Home theater system, a smartphone, a Tablet PC, a digital video recorder (DVR) and the like.

In addition, the processing method to which the present disclosure is applied, may be produced in the form of a program executed by a computer, and be stored in a computer-readable recording medium. Multimedia data having a data structure according to the present disclosure may also be stored in a computer-readable recording medium. The computer-readable recording medium includes all kinds of storage devices and distributed storage devices in which computer-readable data are stored. The computer-readable recording medium may include, for example, a Blu-ray Disc (BD), a universal serial bus (USB), a ROM, a PROM, an EPROM, an EEPROM, a RAM, a CD-ROM, a magnetic tape, a floppy disk, and an optical data storage device. Further, the computer-readable recording medium includes media embodied in the form of a carrier wave (for example, transmission over the Internet). In addition, a bitstream generated by the encoding method may be stored in a computer-readable recording medium or transmitted through a wired or wireless communication network. Additionally, the embodiments of the present disclosure may be embodied as a computer program product by program codes, and the program codes may be executed on a computer by the embodiments of the present disclosure. The program codes may be stored on a computer-readable carrier.

FIG. 15 schematically illustrates an example of a video/image coding system to which the present disclosure is applicable.

Referring to FIG. 15 , the video/image coding system may include a first device (source device) and a second device (receive device). The source device may deliver encoded video/image information or data in the form of a file or streaming to the receive device via a digital storage medium or network.

The source device may include a video source, an encoding apparatus, and a transmitter. The receive device may include a receiver, a decoding apparatus, and a renderer. The encoding apparatus may be called a video/image encoding apparatus, and the decoding apparatus may be called a video/image decoding apparatus. The transmitter may be included in the encoding apparatus. The receiver may be included in the decoding apparatus. The renderer may include a display, and the display may be configured as a separate device or an external component.

The video source may obtain a video/image through a process of capturing, synthesizing, or generating a video/image. The video source may include a video/image capture device and/or a video/image generating device. The video/image capture device may include, for example, one or more cameras, video/image archives including previously captured video/images, or the like. The video/image generating device may include, for example, a computer, a tablet and a smartphone, and may (electronically) generate a video/image. For example, a virtual video/image may be generated through a computer or the like. In this case, the video/image capturing process may be replaced by a process of generating related data.

The encoding apparatus may encode an input video/image. The encoding apparatus may perform a series of procedures such as prediction, transform, and quantization for compression and coding efficiency. The encoded data (encoded video/image information) may be output in the form of a bitstream.

The transmitter may transmit the encoded video/image information or data output in the form of a bitstream to the receiver of the receive device through a digital storage medium or a network in the form of a file or streaming. The digital storage medium may include various storage mediums such as USB, SD, CD, DVD, Blu-ray, HDD, SSD, and the like. The transmitter may include an element for generating a media file through a predetermined file format, and may include an element for transmission through a broadcast/communication network. The receiver may receive/extract the bitstream and transmit the received/extracted bitstream to the decoding apparatus.

The decoding apparatus may decode a video/image by performing a series of procedures such as dequantization, inverse transform, prediction, and the like corresponding to the operation of the encoding apparatus.

The renderer may render the decoded video/image. The rendered video/image may be displayed through the display.

FIG. 16 illustrates the structure of a content streaming system to which the present disclosure is applied.

Further, the contents streaming system to which the present disclosure is applied may largely include an encoding server, a streaming server, a web server, a media storage, a user equipment, and a multimedia input device.

The encoding server functions to compress to digital data the contents input from the multimedia input devices, such as the smart phone, the camera, the camcoder and the like, to generate a bitstream, and to transmit it to the streaming server. As another example, in a case where the multimedia input device, such as, the smart phone, the camera, the camcoder or the like, directly generates a bitstream, the encoding server may be omitted. The bitstream may be generated by an encoding method or a bitstream generation method to which the present disclosure is applied. And the streaming server may store the bitstream temporarily during a process to transmit or receive the bitstream.

The streaming server transmits multimedia data to the user equipment on the basis of a user's request through the web server, which functions as an instrument that informs a user of what service there is. When the user requests a service which the user wants, the web server transfers the request to the streaming server, and the streaming server transmits multimedia data to the user. In this regard, the contents streaming system may include a separate control server, and in this case, the control server functions to control commands/responses between respective equipments in the content streaming system.

The streaming server may receive contents from the media storage and/or the encoding server. For example, in a case the contents are received from the encoding server, the contents may be received in real time. In this case, the streaming server may store the bitstream for a predetermined period of time to provide the streaming service smoothly.

For example, the user equipment may include a mobile phone, a smart phone, a laptop computer, a digital broadcasting terminal, a personal digital assistant (PDA), a portable multimedia player (PMP), a navigation, a slate PC, a tablet PC, an ultrabook, a wearable device (e.g., a watch-type terminal (smart watch), a glass-type terminal (smart glass), a head mounted display (HMD)), a digital TV, a desktop computer, a digital signage or the like. Each of servers in the contents streaming system may be operated as a distributed server, and in this case, data received by each server may be processed in distributed manner.

Claims disclosed herein can be combined in a various way. For example, technical features of method claims of the present disclosure can be combined to be implemented or performed in an apparatus, and technical features of apparatus claims can be combined to be implemented or performed in a method. Further, technical features of method claims and apparatus claims can be combined to be implemented or performed in an apparatus, and technical features of method claims and apparatus claims can be combined to be implemented or performed in a method. 

1. An image decoding method performed by a decoding apparatus, the method comprising: deriving a position of a last significant coefficient in a current block and transform coefficients for the current block based on residual information from a bitstream; and deriving residual samples for the current block by applying a transform kernel derived based on a multiple transform selection (MTS) index related to an inverse primary transform to the transform coefficients; wherein the deriving of the transform coefficient comprises: parsing a flag related to whether a significant coefficient is present in a scan subblock by scanning the scan subblock in a preset scan subblock unit according to an reverse diagonal scan order; determining whether the scan subblock belongs to a second region other than a top-left first region of the current block, determining whether a color index of the current block indicates a luma component; and deriving flag information related to whether the significant coefficient is present in the second region based on a value of the flag, whether the scan subblock belongs to the second region, and the color index, wherein the MTS index is not parsed based on the flag information indicating that the significant coefficient is present in the second region, and wherein a last scan subblock is derived based on the position of the last significant coefficient, and the scan subblock is scanned from the last scan subblock according to the reverse diagonal scan order.
 2. The image decoding method of claim 1, wherein the flag information is initially set to 1, and wherein, the flag information is changed to 0 based on the value of the flag being 0, the scan subblock belonging to the second region, and the color index indicating the luma component.
 3. The image decoding method of claim 2, wherein when the flag information is changed to 0, the MTS index is not parsed, and wherein the MTS index is inferred to 0 when the MTS index is not parsed.
 5. The image decoding method of claim 1, wherein the top-left first region is a top-left 16×16 region of the current block, and wherein the scan subblock is a 4×4 block.
 6. (canceled)
 7. An image encoding method performed by an image encoding apparatus, the method comprising: deriving residual samples for a current block based on prediction samples for the current block; deriving transform coefficients for the current block based on a primary transform for the residual samples; constructing image information to parse a multiple transform selection (MTS) index related to the primary transform based on a significant coefficient not being present in a second region other than a top-left first region of the current block; and encoding residual information derived based on the transform coefficients for the current block and an MTS index, whether the constructing of the image information comprise: encoding a flag related to whether the significant coefficient is present in a scan subblock by scanning the scan subblock in a preset scan subblock unit according to an reverse diagonal scan order; determining whether the scan subblock belongs to the second region; determining whether a color index of the current block indicates a luma component; and deriving flag information related to whether the significant coefficient is present in the second region based on a value of the flag, whether the scan subblock belongs to the second region, and the color index, wherein the MTS index is not encoded based on the flag information indicating that the significant coefficient is present in the second region, and wherein a last scan subblock is derived based on the position of a last significant coefficient in the current block, and the scan subblock is scanned from the last scan subblock according to the reverse diagonal scan order.
 8. The image encoding method of claim 7, wherein the flag information is initially set to 1, and wherein, the flag information is changed to 0 based on the value of the flag being 0, the scan subblock belonging to the second region, and the color index indicating the luma component.
 9. The image encoding method of claim 8, wherein when the flag information is changed to 0, the MTS index is not encoded, and wherein the MTS index is inferred to 0 when the MTS index is not encoded.
 10. (canceled)
 11. The image encoding method of claim 7, wherein the top-left first region is a top-left 16×16 region of the current block, and wherein the scan subblock is a 4×4 block.
 12. A non-transitory computer-readable digital storage medium that stores a bitstream generated by a method, the method comprising: deriving residual samples for a current block based on prediction samples for the current block; deriving transform coefficients for the current block based on a primary transform for the residual samples; constructing image information to parse a multiple transform selection (MTS) index related to the primary transform based on a significant coefficient not being present in a second region other than a top-left first region of the current block; and encoding residual information derived based on the transform coefficients for the current block and an MTS index to generate the bitstream, whether the constructing of the image information comprise: encoding a flag related to whether the significant coefficient is present in a scan subblock by scanning the scan subblock in a preset scan subblock unit according to an reverse diagonal scan order; determining whether the scan subblock belongs to the second region; determining whether a color index of the current block indicates a luma component; and deriving flag information related to whether the significant coefficient is present in the second region based on a value of the flag, whether the scan subblock belongs to the second region, and the color index, wherein the MTS index is not encoded based on the flag information indicating that the significant coefficient is present in the second region, and wherein a last scan subblock is derived based on the position of a last significant coefficient in the current block, and the scan subblock is scanned from the last scan subblock according to the reverse diagonal scan order. 